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.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics articles
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 coNP
you get
P ≠ NP 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)reply
This article should be updated to account for CLS = PPAD ∩ PLS
Could we remember some of the most basic parts of
WP:MOS and
WP:MOSMATH here:
Don't capitalize an initial letter merely because it is in a section heading.
In non-TeX math notation, italicize things that are italicized in LaTeX but not other things. I.e. variables are italicized; things liks cos, log, det, max, etc. are not, and punctuation and digits are not.
Use proper spacing in non-TeX math notation, i.e. a + b = 1, not a+b=1. One can refer to a number like +3 with no space between "+" and "3", but when it's a binary operation, put the space there.