Faster Fourier Transform

OpenAI posted a paper claiming an algorithm can compute the discrete Fourier transform in O(n (log n)^(1 − ε)) time for ε = 10^−13, a marginal asymptotic improvement over the Fast Fourier Transform's O(n log n). The Fast Fourier Transform remains the standard method for computing the discrete Fourier transform of a sequence of length n.

The Fast Fourier Transform FFT algorithm can compute the discrete Fourier transform of a sequence of length n in time O n log n . OpenAI recently posted a paper saying there is an algorithm that could compute the discrete Fourier transform in O n log n 1 − ε time for ε = 10−13. This result is amazing. It seemed that … The post