The Accelerated Euclidean Algorithm
classification
💻 cs.DS
keywords
algorithmacceleratedcomplexityeuclideaninputsintegersiterativepolynomials
read the original abstract
We present a new GCD algorithm of two integers or polynomials. The algorithm is iterative and its time complexity is still $O(n \\log^2 n ~ log \\log n)$ for $n$-bit inputs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.