Truly Subquadratic 3SUM and Subcubic APSP Break Decades-Old Barriers, Reportedly with Claude's Help

Josh Alman and Virginia Vassilevska Williams posted an arXiv preprint, "Truly Subquadratic 3SUM and Truly Subcubic APSP via Triangles in Sparse Lopsided Graphs," delivering the first polynomial improvements for two textbook problems: deterministic O(n^1.9992) for 3SUM on n polynomially-bounded integers, and O(n^2.9995) for integer-weight APSP. These break the long-standing n² and n³ barriers, effectively refuting the 3SUM and APSP hypotheses and reshaping fine-grained complexity theory. Social media reports say Anthropic's Claude contributed to discovering the core algorithms, though no direct statement from the paper or Anthropic is available yet.

Confirmed

Unconfirmed

Why it matters

2026-10-06 ~ 2026-10-08 · 13 related posts

Full story(4 episodes)→

Primary sources

2 near-duplicate retellings: ctjlewis · aran_nayebi