Scott Aaronson personal blog
Matrix multiplication in O(n^2.373)
For twenty years, the fastest known algorithm to multiply two n-by-n matrices, due to Coppersmith and Winograd, took a leisurely O(n2.376) steps. Last year, though, in his PhD thesis, Andrew Stot…
- Points
- 166
- HN comments
- 52
- Submissions
- 1
- Cited by
- 0 commenters
Math & AlgorithmsSoftware Engineering2011
On Hacker News
| Submitted | Title on HN | Points | Comments |
|---|---|---|---|
| Nov 29, 2011 | Matrix multiplication in O(n^2.373) by davepeck | 166 | 52 |
