Discrete Fourier Transform Complexity: How OpenAI Cracked the n log n Barrier
The Fast Fourier Transform has spent decades turning quadratic calculations into manageable work. OpenAI now presents a proof that discrete Fourier transform complexity can fall below the familiar O(nlogn)O(n\log n) scale, at every input length. The improvement is asymptotic, deterministic, and exact, but it belongs to a computational model with unrestricted complex coefficients and supplied … Read more