I don't know this is a proper question on this forum but I was reading about computability theory and computational complexity theory and I saw the reduction concept and its notation like this: A ≤p B. I just wanted to know is this notation can be reversed? that is, can I write this down like A ≥p B? I searched a lot but this notation always been like the former.


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.