AI-Discovered Algorithm Delivers First True Subquadratic 3SUM and Subcubic APSP
FrnkNlsn · x · 2026-10-06
An arXiv paper by Josh Alman and Virginia Vassilevska Williams gives the first polynomial improvements over textbook algorithms: deterministic 3SUM in O(n^1.9992) and APSP in O(n^2.9995), refuting the 3SUM and APSP hypotheses plus several related conjectures. The core is a new thin matrix product algorithm modifying Coppersmith-style rectangular multiplication. Per Carl Feynman's account, the algorithm was discovered by AI — someone at Anthropic stumbled on it while asking Claude to solve another problem, then funded two outside researchers to write the paper. Commenters call it a major advance in polynomial complexity.
More from AGI Musings
- Fields Medalist Bao Chau Ngo on AI proof of Riemann Hypothesis: treat AI output as data — Dr_Atoosa · 2026-11-22
- AI math pace outruns expert timelines: two Millennium Prize-level problems now reportedly solved — haider1 · 2026-11-22
- eigenrobot: In 2020 I'd have bet we'd prove the Riemann hypothesis before fixing obesity — eigenrobot · 2026-11-22
- AI researcher tszzl: a 'biblical flood' is coming to San Francisco, for obvious reasons — tszzl · 2026-11-22
- NYT Magazine asks: the internet broke our taste — will AI destroy it for good? — dreamwieber · 2026-11-22
- Tao expected the Riemann Hypothesis to fall by 2050 — it took AI only 35 days — SydSteyerhart · 2026-11-22