Scott Aaronson personal blog
Knuth on Huang's Sensitivity Proof: “I've got the proof down to one page” [pdf]
The Sensitivity Conjecture, which I blogged about here, says that, for every Boolean function f:{0,1}n→{0,1}, the sensitivity of f—that is, the maximum, over all 2n input strings x∈{0,1}n, of…
- Points
- 462
- HN comments
- 106
- Submissions
- 2
- Cited by
- 5 commenters
Math & AlgorithmsSoftware Engineering2019
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Aug 1, 2019 | Knuth on Huang's Sensitivity Proof: “I've got the proof down to one page” [pdf] by espeed | 462 | 98 |
| Jul 2, 2019 | Sensitivity Conjecture Resolved by traderjane | 131 | 8 |
Cited in comments
Linked from 5 Hacker News comments by 5 different people, from Jul 2019 to Feb 2021.
Most recent:
- alberto_ol · Feb 12, 2021
- scythmic_waves · Feb 12, 2021
- superpermutat0r · Jan 7, 2020
- zcbenz · Aug 2, 2019
- floatingatoll · Jul 26, 2019
