The exact length of the Euclidean algorithm in [ X ]

DOI10.1112/S002557930001528XzbMath0676.12004MaRDI QIDQ3831108

Arnold Knopfmacher, John Knopfmacher

Publication date: 1988

Published in: Mathematika (Search for Journal in Brave)

zbMATH Keywords

average length of the Euclidean algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Polynomials over finite fields (11T06)

Related Items (7)

Probabilistic analyses of the plain multiple gcd algorithm ⋮ Fine costs for Euclid's algorithm on polynomials and Farey maps ⋮ Gaussian laws for the main parameters of the Euclid algorithms ⋮ D?E?K=(1000)8 ⋮ Analysis of generalized continued fraction algorithms over polynomials ⋮ The depth of continued fraction expansion for some classes of rational functions ⋮ The number of steps in the Euclidean algorithm over complex quadratic fields

Cites Work

• Untersuchung über die Schrittanzahl des euklidischen Algorithmus bei Anwendung auf echte Brüche
• The Arithmetic of Polynomials in a Galois Field
• A Simple Estimate for the Number of Steps in the Euclidean Algorithm
• The number of steps in the Euclidean algorithm

This page was built for publication: The exact length of the Euclidean algorithm in [ X ]