Timeline for Common false beliefs in theoretical computer science
Current License: CC BY-SA 2.5
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 22, 2013 at 15:57 | comment | added | John Kemeny | “For every polynomial-time algorithm you have, there is an exponential algorithm that I would rather run” -- Alan Perlis, via Gödel’s Lost Letter and P=NP. | |
| Dec 8, 2010 at 2:02 | comment | added | Hsien-Chih Chang 張顯之 | The blog post by Lipton are nice: rjlipton.wordpress.com/2009/07/03/is-pnp-an-ill-posed-problem | |
| Dec 8, 2010 at 2:00 | history | edited | Sadeq Dousti | CC BY-SA 2.5 |
deleted 52 characters in body
|
| S Dec 8, 2010 at 1:56 | history | answered | chazisop | CC BY-SA 2.5 | |
| S Dec 8, 2010 at 1:56 | history | made wiki | Post Made Community Wiki |