Take the 2-minute tour ×
Computer Science Stack Exchange is a question and answer site for students, researchers and practitioners of computer science. It's 100% free, no registration required.

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

share|improve this question

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.

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

1 Answer 1

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}$.

share|improve this answer

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

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