Does the proof of the widely believed result P $\neq$ NP depend on the proof of NP $\neq$ Co-NP ?


migrated from cstheory.stackexchange.com Jan 10 '13 at 2:48

This question came from our site for theoretical computer scientists and researchers in related fields.

  • $\begingroup$ Which proofs are you referring to? What do you mean by depending? $\endgroup$ – Kaveh Jan 10 '13 at 2:44

Only in one direction. As $\mathsf{P}=\text{co-}\mathsf{P}$, if $\mathsf{NP}\neq\text{co-}\mathsf{NP}$ then we would know that $\mathsf{P}\neq\mathsf{NP}$. However the reverse implication doesn't hold. If $\mathsf{P}\neq\mathsf{NP}$ then it's possible that either $\mathsf{NP}\neq\text{co-}\mathsf{NP}$ or $\mathsf{NP}=\text{co-}\mathsf{NP}$.


Your Answer

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

Not the answer you're looking for? Browse other questions tagged or ask your own question.