Fourier transforms pushed to O(N log(N)^0.9999...), nearly closing the log gap
burny_tech · x · 2026-10-07
An algorithm result making the rounds: Fourier transforms can now be computed in O(N log(N)^0.9999999999999) time — squeezing the exponent on the log factor essentially to 1, asymptotically approaching the theoretical O(N log N) optimum. The poster's incredulous framing reflects how extreme the improvement looks on paper, with implications for large-scale signal processing and numerical computation theory.
More from Research
- eigenrobot: automating math papers is easy, and most of economics and theoretical physics is next — eigenrobot · 2026-10-07
- François Fleuret: math is unique in that its truths are "context free" — francoisfleuret · 2026-10-07
- Two Years After First Reasoning Model, AI Has Produced '20 Fields Medals' of New Math — __nmca__ · 2026-10-07
- NUS releases SafeActBench: 656 cases reveal where tool-using agents break the evidence-to-action chain — NationalUniversityofSingapore · 2026-10-07
- MEND: RL for flow models via proximal velocity matching beats Flow-GRPO in 100 vs ~4k updates — UTEXAS · 2026-10-07
- JLD: perceptual distance from a frozen encoder's Jacobian, fitted in 35s from 100 images, beats LPIPS and DISTS — Shreshth Saini · 2026-10-07