Complexity classes P and NP/Talk
HomePage
|
Complexity classes P and NP
|
Recent Changes
|
Preferences
Showing revision 1
This question was asked on
http://www.slashdot.org
a little while ago, and it seems relevant here: What, if any, would be the effects of a proof that P=NP, or that P≠NP, or indeed that the question is undecidable?
-
Stuart