Fast 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 …