The Computing Time of the Euclidean Algorithm

DOI10.1137/0203001zbMath0288.68019OpenAlexW1999773905MaRDI QIDQ4776833

George E. Collins

Publication date: 1974

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0f5093781568129cc3bb0f2054de693bb2812602

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical computation of solutions to systems of equations (65H10) Numerical computation of solutions to single equations (65H05)

Related Items (9)

Efficient computation of addition chains ⋮ Computer algebra: Past and future ⋮ On the computing time of the continued fractions method ⋮ Analysis of Euclidean algorithms for polynomials over finite fields ⋮ New bounds for the Descartes method ⋮ Continued fraction real root isolation using the Hong root bound ⋮ Computing the Greatest Common Divisor of Polynomials Using the Comrade Matrix ⋮ A note on solving linear Diophantine systems by usingL³-reduction algorithm ⋮ A fast Euclidean algorithm for Gaussian integers

This page was built for publication: The Computing Time of the Euclidean Algorithm