Year: 2004
Type: preprint
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.
Source: arXiv (Cornell University)
Author: Sedjelmaci, Sidi Mohamed
Institution: Laboratoire d'Informatique de Paris-Nord
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W1644563139