The number of steps in the Euclidean algorithm
From MaRDI portal
Publication:5921064
DOI10.1016/0022-314X(70)90044-2zbMath0206.33502OpenAlexW1997160752WikidataQ56047910 ScholiaQ56047910MaRDI QIDQ5921064
Publication date: 1970
Published in: Journal of Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-314x(70)90044-2
Related Items (33)
An approximating \(k\)-ary GCD algorithm ⋮ A note on ``Euclidean algorithms are Gaussian by V. Baladi and B. Vallée ⋮ Computer algebra: Past and future ⋮ Connectivity of discrete planes ⋮ The length of the continued fraction expansion for a class of rational functions in ⋮ Obfuscated fuzzy Hamming distance and conjunctions from subset product problems ⋮ On crepant resolutions of 2-parameter series of Gorenstein cyclic quotient singularities ⋮ Continued fraction algorithms, functional operators, and structure constants ⋮ Limit laws for rational continued fractions and value distribution of quantum modular forms ⋮ Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums ⋮ Dynamical analysis of a class of Euclidean algorithms. ⋮ Probabilistic analyses of the plain multiple gcd algorithm ⋮ Über die Schrittanzahl beim Algorithmus von Harris und dem nach nächsten Ganzen ⋮ Analysis of Euclidean algorithms for polynomials over finite fields ⋮ Fine costs for Euclid's algorithm on polynomials and Farey maps ⋮ Structured semidefinite programs for the control of symmetric systems ⋮ On the asymptotic analysis of the Euclidean algorithm ⋮ Computing GCD's by normalized division ⋮ Estimate for dispersion of lengths of continued fractions ⋮ On Gauss-Kuz'min statistics for finite continued fractions ⋮ The exact length of the Euclidean algorithm in [ X ] ⋮ Gaussian laws for the main parameters of the Euclid algorithms ⋮ Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems ⋮ Euclidean algorithms are Gaussian ⋮ The number of steps in a finite Jacobi algorithm ⋮ On the statistical properties of finite continued fractions ⋮ Euclidean rings of algebraic numbers and functions ⋮ A note on solving linear Diophantine systems by usingL3-reduction algorithm ⋮ Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms ⋮ Dynamics of continued fractions with periodic constraints ⋮ EICHLER COHOMOLOGY THEOREM FOR VECTOR-VALUED MODULAR FORMS ⋮ An upper bound on the average number of iterations of the LLL algorithm ⋮ The number of steps in the Euclidean algorithm over complex quadratic fields
Cites Work
This page was built for publication: The number of steps in the Euclidean algorithm
