The Computing Time of the Euclidean Algorithm

DOI10.1137/0203001MaRDI QIDQ4776833zbMATH OpenOpenAlexFDO

Authors 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)

Cited in

(9)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4776833)