Pages that link to "Item:Q912620"
From MaRDI portal
The following pages link to Analysis of Euclidean algorithms for polynomials over finite fields (Q912620):
Displaying 6 items.
- Probabilistic analyses of the plain multiple gcd algorithm (Q898274) (← links)
- Computing GCD's by normalized division (Q1191635) (← 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)
- 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)
