The Accelerated Euclidean Algorithm

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

Description

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.

Keywords

Data Structures and Algorithms

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/32469

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/0412006
 http://arxiv.org/abs/cs/0412006
 Proceedings of the EACA, (2004) 283-287

Collections

arXiv