Gao’s additive FFT (Discrete Fourier Transform Discrete Fourier Transform)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n logn loglogn)$

Space Complexity

$O(n)$ words

(https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?arnumber=5625613)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

2010

Reference

https://ieeexplore-ieee-org.ezproxy.canberra.edu.au/stamp/stamp.jsp?arnumber=5625613

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Gao’s_additive_FFT_(Discrete_Fourier_Transform_Discrete_Fourier_Transform)&oldid=45328"