Schönhage–Strassen algorithm ( Multiplication)

From Algorithm Wiki
Revision as of 10: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.ezproxy.canberra.edu.au/article/10.1007/BF02242355")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

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.ezproxy.canberra.edu.au/article/10.1007/BF02242355

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Schönhage–Strassen_algorithm_(_Multiplication)&oldid=44655"