Pages that link to "Item:Q912620"

The following pages link to Analysis of Euclidean algorithms for polynomials over finite fields (Q912620):

Displaying 12 items.

• Probabilistic analyses of the plain multiple gcd algorithm (Q898274) (← links)
• Computing GCD's by normalized division (Q1191635) (← links)
• Dynamics of the binary Euclidean algorithm: Functional analysis and operators (Q1277390) (← links)
• Analysis of generalized continued fraction algorithms over polynomials (Q2031651) (← links)
• On those multiplicative subgroups of \({\mathbb F}_{2^n}^\ast\) which are Sidon sets and/or sum-free sets (Q2114773) (← links)
• Subresultants in multiple roots: an extremal case (Q2361559) (← links)
• The polynomial Euclidean algorithm and the linear equation \(AX + BY = \gcd(A, B)\) (Q2363604) (← links)
• Numerical stability of Euclidean algorithm over ultrametric fields (Q2397945) (← links)
• Relatively prime polynomials and nonsingular Hankel matrices over finite fields (Q2431247) (← links)
• Fine costs for Euclid's algorithm on polynomials and Farey maps (Q2439896) (← links)
• Inside Euclid's algorithm (Q3972078) (← links)
• Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field (Q5886315) (← links)