Integer multiplication can beat n log n, shaking faith in 'lower bounds', researchers react
deanwball · x · 2026-10-07
New work shows integer multiplication can be done faster than n log n, long assumed to be a lower bound. Observers marvel that such "neat" lower bounds may just be weak approximations from our limited human faculties.
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