Sthele, Zimmermann (Greatest Common Divisor Greatest Common Divisor)
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