Gao’s additive FFT (Discrete Fourier Transform Discrete Fourier Transform)
Jump to navigation
Jump to search
Time Complexity
$O(n logn loglogn)$
Space Complexity
$O(n)$ words
(https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=5625613)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word/Real RAM
Year
2010
Reference
https://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=5625613