Sub-n log n FFT, subcubic APSP and subquadratic 3SUM in one day stun algorithmists
burny_tech · x · 2026-10-07
Researcher Aran Nayebi reacted to a remarkable day in algorithms: a sub-n·log n FFT (faster-than-ever integer multiplication), subcubic APSP, and subquadratic 3SUM all landing at once.
- "Today has shaken my belief that humans were ever good at algorithms," he wrote
- He joked he's updated toward "maybe P = NP after all," via some clever n^c-time SAT algorithm (c 10^6) that GPT-8 might discover
- The original quip came from AcerFur's surprise at the new integer multiplication bound beating n log n
A snapshot of how alarmed — and excited — theory folks are getting about AI-assisted algorithm discovery.
Related event: Subquadratic 3SUM and Subcubic APSP Break Decades-Old Barriers(10 posts)→
More from Fun
- Singapore hosts its first humanoid robot fight, complete with a knockout — DJiafei · 2026-10-07
- YouTube channel puts "27M views" right in its channel name to fake clout — rounak · 2026-10-07
- 18 hours of Claude made a Windows XP-themed song, now on Spotify — TinfoilTricorn · 2026-10-07
- 'Worthless in six years': AI-circle quip about knowledge depreciation gets a comeback — yacinelearning · 2026-10-07
- "Forget ICLR — STOC, FOCS and SODA are about to hit 100k submissions" — IgorCarron · 2026-10-07
- Em dashes are now considered the enemy of performance — DanielLockyer · 2026-10-07