|WikiProject Mathematics||(Rated Stub-class, Low-priority)|
isnt the sufficient context provided in the article about computational complexity theory?
- TFNP ≠ FP would imply NP = coNP.
cannot be true, since combined with the claim
- TFNP = FP would imply P = NP coNP
- P ≠ NP coNP implies NP = coNP