Is shaving small constants off exponents a breakthrough? Algorithm theorists debate n^1.999 results
srchvrs · x · 2026-10-07
- Context: Recent results like 3-sum in n^1.999 and multiplication in n(log n)^0.999 have sparked debate.
- Skeptic (srchvrs): Shaving small constants off known exponents may just be a hack. Past asymptotic improvements with galactic constants never mattered practically — if a 2x speedup requires 10^10 more compute, it's useless in a world of finite resources.
- Counterpoint (thomasahle): Worrying that math is "all square packing" underneath misses the point — an ugly result usually just means you picked the wrong perspective.
- The thread captures the classic tension between theoretical algorithm improvements and practical utility.
Related event: Integer Multiplication Breaks the n log n Barrier, with AI Leading the Way(11 posts)→
More from Research
- Stanford CS312 teaches deep learning by experiment prediction; suggested as synthetic-data seed for frontier labs — jasondeanlee · 2026-11-22
- John Langford weighs in on FBT note: fixed-point convergence and quantized caching — JohnCLangford · 2026-11-22
- 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