Schönhage–Strassen algorithm ( Multiplication)
Revision as of 11:38, 15 February 2023 by Admin (talk | contribs) (Created page with "== Time Complexity == $O(n logn loglogn)$ == 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 == Reference == https://link.springer.com/article/10.1007/BF02242355")
Time Complexity
$O(n logn loglogn)$
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