Truly subcubic APSP and truly subquadratic 3SUM breakthrough reshapes fine-grained complexity
thegautamkamath · x · 2026-10-06
- Researchers report two major breakthroughs in fine-grained complexity: APSP (all-pairs shortest paths) solved in truly subcubic time, and 3SUM in truly subquadratic time.
- Commenters call these "truly remarkable results" but note they strip away much of the field's fun: the APSP and 3SUM hypotheses were the standard bases for conditional lower bounds, and algorithmic progress now undermines them.
- The deeper question is how future research proceeds — many conditional lower-bound results built on these assumptions may need revisiting, opening significant "new" questions about how the field should be done.
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