Schönhage–Strassen algorithm ( Multiplication)

Time Complexity

$O(n \log n \log\log n)$

Space Complexity

$O(n)$ auxiliary? bits

(Depends on DFT/FFT algorithm? but all vectors/numbers are of size O(n) and there are a constant number of such objects)

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM?

Year

1971

Reference

https://link-springer-com.ezproxy.canberra.edu.au/article/10.1007/BF02242355