The Accelerated Euclidean Algorithm

Simple item page
dc.creatorSedjelmaci, Sidi Mohamed
dc.date2004-12-02
dc.date.accessioned2026-07-07T03:22:07Z
dc.date.available2026-07-07T03:22:07Z
dc.descriptionWe 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.
dc.identifierhttps://arxiv.org/abs/cs/0412006
dc.identifierhttp://arxiv.org/abs/cs/0412006
dc.identifierProceedings of the EACA, (2004) 283-287
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/32469
dc.subjectData Structures and Algorithms
dc.titleThe Accelerated Euclidean Algorithm
dc.typetext

Files

Collections

arXiv