The Accelerated Euclidean Algorithm
Data Structures and Algorithms
2007-05-23 v1
Abstract
We present a new GCD algorithm of two integers or polynomials. The algorithm is iterative and its time complexity is still for -bit inputs.
Cite
@article{arxiv.cs/0412006,
title = {The Accelerated Euclidean Algorithm},
author = {Sidi Mohamed Sedjelmaci},
journal= {arXiv preprint arXiv:cs/0412006},
year = {2007}
}