Sthele, Zimmermann (Greatest Common Divisor Greatest Common Divisor): Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Time Complexity == $O(n log^{2} n log log n)$ == Space Complexity == $O(n)$?? bits (Depends on Schonhage-Strassen multiplication) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM? words size O(1) == Year == 2006 == Reference == https://hal.inria.fr/file/index/docid/71533/filename/RR-5050.pdf") |
No edit summary |
||
| Line 1: | Line 1: | ||
== Time Complexity == | == Time Complexity == | ||
$O(n log^{2} n log log n)$ | $O(n \log^{2} n \log \log n)$ | ||
== Space Complexity == | == Space Complexity == | ||
Latest revision as of 08:57, 10 April 2023
Time Complexity
$O(n \log^{2} n \log \log n)$
Space Complexity
$O(n)$?? bits
(Depends on Schonhage-Strassen multiplication)
Description
Approximate?
Exact
Randomized?
No, deterministic
Model of Computation
Word RAM? words size O(1)
Year
2006
Reference
https://hal.inria.fr/file/index/docid/71533/filename/RR-5050.pdf