3SUM Solved in O(n^1.9992): Alman & Vassilevska Williams Refute the 3SUM and APSP Hypotheses
auto_grad_ · x · 2026-10-06
Josh Alman and Virginia Vassilevska Williams posted a new paper giving the first polynomial improvements over the textbook algorithms: 3SUM on n polynomial-size integers is solved deterministically in O(n^1.9992) time, and APSP on directed n-vertex graphs with polynomially bounded integer weights in O(n^2.9995) time. This refutes both the 3SUM and APSP hypotheses, long-standing cornerstones of fine-grained complexity theory.\n\nVia known reductions, the paper also refutes the real-valued 3SUM/APSP hypotheses, the Exact Triangle hypothesis, the Zero-Weight k-Clique hypotheses, and three rectangular hinted Online Matrix–Vector conjectures, while yielding polynomial speedups for many other problems. Everything follows from a single new algorithm for thin matrix products: for an N×D and a D×N integer matrix (D≤N^1/18), computing any N²/√D requested entries of the product takes only O(N²/D^0.063) operations—faster than computing those inner products one by one—built by modifying Coppersmith's rectangular matrix multiplication algorithm via a ten-multiplication identity of Schönhage.
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