77
Voted
CORR
2004
Springer
15 years 9 days ago
2004
Springer
We propose a new GCD algorithm called Accelerated Euclidean Algorithm, or AEA for short, which matches the O(n log2 n log log n) time complexity of the Sch