-3
$\begingroup$

We currently don't know the relationship between NP and co-NP, but would it be possible to show whether the intersection is equal to P? I can't think of any languages in both NP and co-NP, but not in P.

$\endgroup$

closed as off-topic by Emil Jeřábek supports Monica, Gamow, D.W., Jan Johannsen, Aryeh Feb 14 at 14:42

This question appears to be off-topic. The users who voted to close gave this specific reason:

  • "Your question does not appear to be a research-level question in theoretical computer science. For more information about the scope, please see help center. Your question might be suitable for Computer Science which has a broader scope." – Emil Jeřábek supports Monica, Gamow, D.W., Jan Johannsen, Aryeh
If this question can be reworded to fit the rules in the help center, please edit the question.

  • $\begingroup$ Note that you can't prove that any NP problem is outside of P as that would imply that P != NP $\endgroup$ – John Dvorak Feb 13 at 13:13
3
$\begingroup$

Proving that $P= NP \cap$ co-$NP$ is an open problem and believed to be unlikely since Integer factoring decision problem is in both $NP$ and co-$NP$ but conjectured to be outside $P$.

$\endgroup$

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