Pages that link to "Item:Q3831108"

The following pages link to The exact length of the Euclidean algorithm in [ <i>X</i> ] (Q3831108):

Displaying 8 items.

• The number of steps in the Euclidean algorithm over complex quadratic fields (Q807674) (← links)
• Probabilistic analyses of the plain multiple gcd algorithm (Q898274) (← links)
• Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation? (Q2023309) (← links)
• Analysis of generalized continued fraction algorithms over polynomials (Q2031651) (← links)
• Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896) (← links)
• Gaussian laws for the main parameters of the Euclid algorithms (Q2482727) (← links)
• \(D\cdot E\cdot K=(100)_8\) (Q2772918) (← links)
• The depth of continued fraction expansion for some classes of rational functions (Q4985469) (← links)