Pages that link to "Item:Q3833621"
From MaRDI portal
The following pages link to Precise Analyses of the Right- and Left-Shift Greatest Common Divisor Algorithms for $GF(q)[x]$ (Q3833621):
Displaying 5 items.
- Computing GCD's by normalized division (Q1191635) (← 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)
- Two Fast GCD Algorithms (Q4289843) (← links)
- Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field (Q5886315) (← links)
