First truly subquadratic 3SUM algorithm refutes 3SUM and APSP hypotheses
ctjlewis · x · 2026-10-06
A new 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 breakthrough stems from a new thin matrix product algorithm modifying Coppersmith's rectangular matrix multiplication — a milestone in fine-grained complexity theory.
More from Research
- Fields Medalist Bao Chau Ngo on AI proof of Riemann Hypothesis: treat AI output as data — Dr_Atoosa · 2026-11-22
- AI-written six-page proof of Deligne's bound lands, checked only by Claude models — Singularitarian · 2026-11-22
- AI math pace outruns expert timelines: two Millennium Prize-level problems now reportedly solved — haider1 · 2026-11-22
- Darmok AI solves all 7 Times Crossword Championship puzzles, beats human champ by 3m13s — rohanpaul_ai · 2026-11-22
- Do adaptive optimizers still work? Reddit users doubt it for flow-matching models — Inevitable_Pen9043 · 2026-11-22
- Thinking Machines' loop dial tested: 3 inner loops cut written reasoning 41% while MATH accuracy rose to 99% — SonglinYang4 · 2026-11-22