Discrete Fourier Transform faster than n log n [pdf]
By E-Reverance · 2026-10-07 · 2 points · 0 comments
https://github.com/openai/math/blob/main/preprints/Finite-tensor-savings-and-exact-Fourier-circuits-September-25-2026/main.pdf
By E-Reverance · 2 points · 0 comments · on Hacker News, read on BetterNews.
Open the full discussion on BetterNews