On the asymptotic analysis of the Euclidean algorithm

DOI10.1016/S0747-7171(08)80036-3zbMath0704.68055WikidataQ56047911 ScholiaQ56047911MaRDI QIDQ917305

Graham H. Norton

Publication date: 1990

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

zbMATH Keywords

Euclidean algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Multiplicative structure; Euclidean algorithm; greatest common divisors (11A05)

Related Items (2)

Computing GCD's by normalized division ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the number of divisions of the Euclidean algorithm applied to Gaussian integers
• Evaluation of Porter's constant
• Shortest division chains in imaginary quadratic number fields
• On a theorem of Heilbronn
• Computing Gretest Common Divisors and Factorizations in Quadratic Number Fields
• The number of steps in the Euclidean algorithm

This page was built for publication: On the asymptotic analysis of the Euclidean algorithm