Analysis of Euclidean algorithms for polynomials over finite fields
From MaRDI portal
Publication:912620
DOI10.1016/S0747-7171(08)80021-1zbMath0698.68045MaRDI QIDQ912620
Keju Ma, Joachim von zur Gathen
Publication date: 1990
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
factor shift Euclidean algorithmindeterminate shift Euclidean algorithmsubtractive indeterminate shift algorithmsubtractive linear factor shift algorithm
Related Items
Subresultants in multiple roots: an extremal case, Average-case complexity of the Euclidean algorithm with a fixed polynomial over a finite field, Probabilistic analyses of the plain multiple gcd algorithm, Relatively prime polynomials and nonsingular Hankel matrices over finite fields, Fine costs for Euclid's algorithm on polynomials and Farey maps, Computing GCD's by normalized division, On those multiplicative subgroups of \({\mathbb F}_{2^n}^\ast\) which are Sidon sets and/or sum-free sets
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computational problems associated with Racah algebra
- Fast computation of continued fraction expansions.
- Parallel Algorithms for Algebraic Problems
- The Computational Complexity of Continued Fractions
- Representations and Parallel Computations for Rational Functions
- Probabilistic Algorithms in Finite Fields
- A New Algorithm for Factoring Polynomials Over Finite Fields
- Fast computation of GCDs
- Fast parallel matrix and GCD computations
- The Computing Time of the Euclidean Algorithm
- Subresultants and Reduced Polynomial Remainder Sequences
- A characterization of parenthesis languages
- On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
- On Euclid's Algorithm and the Theory of Subresultants
- Factoring Polynomials Over Large Finite Fields
- Euclid's Algorithm for Large Numbers
- The number of steps in the Euclidean algorithm
