# Talk:TFNP

WikiProject Mathematics (Rated Stub-class, Low-priority)
This article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of Mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.
Mathematics rating:
 Stub Class
 Low Priority
Field:  Discrete mathematics

isnt the sufficient context provided in the article about computational complexity theory?

The claim

TFNP ≠ FP would imply NP = coNP.

cannot be true, since combined with the claim

TFNP = FP would imply P = NP ${\displaystyle \cap }$ coNP

you get

P ≠ NP ${\displaystyle \cap }$ coNP implies NP = coNP

which would be a major (and very shocking) breakthrough in complexity theory. —Preceding unsigned comment added by 131.215.220.163 (talk) 00:14, 3 October 2009 (UTC)