Pages that link to "Item:Q2482727"

The following pages link to Gaussian laws for the main parameters of the Euclid algorithms (Q2482727):

Displaying 8 items.

• Numeration and discrete dynamical systems (Q411444) (← links)
• Probabilistic analyses of the plain multiple gcd algorithm (Q898274) (← links)
• A rigorous version of R. P. Brent's model for the binary Euclidean algorithm (Q908058) (← links)
• Regularity of the Euclid algorithm; application to the analysis of fast GCD algorithms (Q1025385) (← links)
• Analysis of generalized continued fraction algorithms over polynomials (Q2031651) (← links)
• The Brun gcd algorithm in high dimensions is almost always subtractive (Q2409010) (← links)
• Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896) (← links)
• Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field (Q5886315) (← links)