Computational Complexity personal blog
Proving P!=NP: "...Ryan has taken the first real baby step in decades."
On October 8th, when in my graduate complexity course as we discussed the 1987 Razborov-Smolensky result that one can't compute the Mod p b...
- Points
- 95
- HN comments
- 5
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2010
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Nov 11, 2010 | Proving P!=NP: "...Ryan has taken the first real baby step in decades." by amichail | 95 | 5 |
