82 citations · 151 across the 23 of their papers we have counts for
1 paper · 1 filter
Michael Kapralov, Ameya Velingker, Amir Zandieh
The Discrete Fourier Transform (DFT) is a fundamental computational primitive, and the fastest known algorithm for computing the DFT is the FFT (Fast Fourier Transform) algorithm.…