Pages that link to "Item:Q5921064"
From MaRDI portal
The following pages link to The number of steps in the Euclidean algorithm (Q5921064):
Displayed 33 items.
- On the statistical properties of finite continued fractions (Q558754) (← links)
- Connectivity of discrete planes (Q596053) (← links)
- The number of steps in the Euclidean algorithm over complex quadratic fields (Q807674) (← links)
- A note on ``Euclidean algorithms are Gaussian'' by V. Baladi and B. Vallée (Q838439) (← links)
- Probabilistic analyses of the plain multiple gcd algorithm (Q898274) (← links)
- Analysis of Euclidean algorithms for polynomials over finite fields (Q912620) (← links)
- On the asymptotic analysis of the Euclidean algorithm (Q917305) (← links)
- Estimate for dispersion of lengths of continued fractions (Q950789) (← links)
- On Gauss-Kuz'min statistics for finite continued fractions (Q950805) (← links)
- Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385) (← links)
- Computer algebra: Past and future (Q1098287) (← links)
- On crepant resolutions of 2-parameter series of Gorenstein cyclic quotient singularities (Q1126956) (← links)
- Continued fraction algorithms, functional operators, and structure constants (Q1127539) (← links)
- Über die Schrittanzahl beim Algorithmus von Harris und dem nach nächsten Ganzen (Q1146706) (← links)
- Computing GCD's by normalized division (Q1191635) (← links)
- The number of steps in a finite Jacobi algorithm (Q1220964) (← links)
- Euclidean rings of algebraic numbers and functions (Q1223443) (← links)
- Dynamics of continued fractions with periodic constraints (Q1273714) (← links)
- An upper bound on the average number of iterations of the LLL algorithm (Q1314406) (← links)
- Dynamical analysis of a class of Euclidean algorithms. (Q1401315) (← links)
- Euclidean algorithms are Gaussian (Q1771021) (← links)
- Obfuscated fuzzy Hamming distance and conjunctions from subset product problems (Q2175905) (← links)
- An approximating \(k\)-ary GCD algorithm (Q2361674) (← links)
- Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896) (← links)
- Structured semidefinite programs for the control of symmetric systems (Q2440744) (← links)
- Gaussian laws for the main parameters of the Euclid algorithms (Q2482727) (← links)
- EICHLER COHOMOLOGY THEOREM FOR VECTOR-VALUED MODULAR FORMS (Q2866999) (← links)
- The length of the continued fraction expansion for a class of rational functions in (Q3203108) (← links)
- A note on solving linear Diophantine systems by using<i>L</i><sup>3</sup>-reduction algorithm (Q3630442) (← links)
- The exact length of the Euclidean algorithm in [ <i>X</i> ] (Q3831108) (← links)
- Digits and continuants in Euclidean algorithms. Ergodic versus Tauberian theorems (Q5939726) (← links)
- Limit laws for rational continued fractions and value distribution of quantum modular forms (Q6075048) (← links)
- Bias in the number of steps in the Euclidean algorithm and a conjecture of Ito on Dedekind sums (Q6093611) (← links)