Schönhage–Strassen algorithm ( Multiplication): Difference between revisions
Jump to navigation
Jump to search
(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") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n | $O(n \log n \log\log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:55, 10 April 2023
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