Sthele, Zimmermann (Greatest Common Divisor Greatest Common Divisor)

From Algorithm Wiki

Revision as of 07:57, 10 April 2023 by Admin (talk | contribs)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

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

Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/w/index.php?title=Sthele,_Zimmermann_(Greatest_Common_Divisor_Greatest_Common_Divisor)&oldid=47045"