Von zur Gathen-Gerhard additive FFT (Discrete Fourier Transform Discrete Fourier Transform)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n (\log n)$^{2})

Space Complexity

$O(n)$ words

(https://dl.acm.org/doi/10.1145/236869.236882)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word/Real RAM

Year

1996

Reference

https://dl.acm.org/doi/10.1145/236869.236882

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Von_zur_Gathen-Gerhard_additive_FFT_(Discrete_Fourier_Transform_Discrete_Fourier_Transform)&oldid=47378"