P versus NP problem: Revision history

11 January 2015

• curprev 00:4100:41, 11 January 2015 en>David Eppstein 51,590 bytes +2,501 Undid revision 641938391 by 2601:2:4A00:15C:CAF:A46B:11AB:4414 (talk) even the edit summary is unintelligible

4 March 2014

• curprev 03:2403:24, 4 March 2014 24.130.123.194 talk 49,089 bytes −126 →Reasons to believe P ≠ NP: I'm Scott Aaronson, the author of a quoted statement. I edited out the sentence about Mozart and Gauss, because while experts understand it, it's generated so many confusions in lay readers that I no longer stand by it

31 January 2014

• curprev 20:3320:33, 31 January 2014 en>LouScheffer 49,215 bytes +49,215 Previous wording was correct; if P=NP such an algorithm exists, and if such an algorithm exists then P=NP (since the problem is NP-complete, so solving this in polynomial time solves all others, too)

1 September 2012

• curprev 22:5122:51, 1 September 2012 en>David Eppstein m 46,991 bytes +46,991 Reverted edits by 24.121.36.139 (talk) to last version by Omnipaedista