送交者: BerkeleyWolf 于 2006-1-18, 11:59:04:

回答: I disagree. In a sense, there isn't much progress made in CS, 由 steven 于 2006-1-18, 01:51:59:

My proof:
suppose NP = P
then N = 1

suppose NP != P
then N != 1

• here is my proof. - steven (161 bytes) 2006-1-18, 13:18:26
• Give me a Turing award, fast ! - BerkeleyWolf (0 bytes) 2006-1-18, 11:59:26
  • A turing award is far less enough for prooging P=?NP - gentoo (0 bytes) 2006-1-18, 15:34:07
    • give me a turing and three Nobel in physics, chem, eco, as well ! - BerkeleyWolf (0 bytes) 2006-1-18, 17:05:57

加跟贴