Schönhage–Strassen algorithm ( Multiplication)
Jump to navigation
Jump to search
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)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM?
Year
1971