Timeline for Why is proving P != NP so hard?
Current License: CC BY-SA 2.5
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 26, 2010 at 17:14 | comment | added | Charles | @Wadim: I strongly suspect (though some differ!) that resolving the P vs. NP problem is in $\text{NC}^0$. ;) | |
| Jul 26, 2010 at 9:40 | comment | added | András Salamon | Scott Aaronson wrote about the algebrization barrier, and also reviews the other main obstacles. scottaaronson.com/papers/alg.pdf | |
| Jul 26, 2010 at 8:37 | history | edited | Greg Kuperberg |
edited tags
|
|
| Jul 26, 2010 at 8:36 | answer | added | Greg Kuperberg | timeline score: 33 | |
| Jul 26, 2010 at 7:43 | comment | added | Wadim Zudilin | Does "so hard" mean "NP hard"?! :-) | |
| Jul 26, 2010 at 7:40 | comment | added | Qiaochu Yuan | There are lots of good references at the Wikipedia article. You can probably also find some good discussions on many CS blogs, e.g. Fortnow's blog, Aaronson's blog, Lipton's blog... | |
| Jul 26, 2010 at 7:37 | history | asked | k2forever | CC BY-SA 2.5 |