The Accelerated Euclidean Algorithm
Sedjelmaci, Sidi Mohamed
Original · EN
We present a new GCD algorithm of two integers or polynomials. The algorithm is iterative and its time complexity is still O(n n log n) for n-bit inputs.
English translation
This paper has no Arabic translation yet. Be the first: it takes a few seconds, and the result is stored for every future reader.