Analysis of Euclidean algorithms for polynomials over finite fields
type: Item
instance of: scholarly article
title: Analysis of Euclidean algorithms for polynomials over finite fields
zbMATH Open document ID: 0698.68045
DOI: 10.1016/S0747-7171(08)80021-1
author: Keju Ma
author: Joachim von zur Gathen
published in: Journal of Symbolic Computation
publication date: 1990-01-01T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 11T06
zbMATH DE Number: 4145332
zbMATH Keywords: indeterminate shift Euclidean algorithm
zbMATH Keywords: factor shift Euclidean algorithm
zbMATH Keywords: subtractive indeterminate shift algorithm
zbMATH Keywords: subtractive linear factor shift algorithm
MaRDI profile type: Publication
cites work: Q4065051
cites work: Factoring Polynomials Over Large Finite Fields
cites work: Fast parallel matrix and GCD computations
cites work: Q4151157
cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
cites work: On Euclid's Algorithm and the Theory of Subresultants
cites work: A New Algorithm for Factoring Polynomials Over Finite Fields
cites work: Subresultants and Reduced Polynomial Remainder Sequences
cites work: The Computing Time of the Euclidean Algorithm
cites work: The number of steps in the Euclidean algorithm
cites work: Parallel Algorithms for Algebraic Problems
cites work: Representations and Parallel Computations for Rational Functions
cites work: Q5613266
cites work: A characterization of parenthesis languages
cites work: Q3935355
cites work: Euclid's Algorithm for Large Numbers
cites work: Q4146667
cites work: Fast computation of GCDs
cites work: Probabilistic Algorithms in Finite Fields
cites work: Fast computation of continued fraction expansions.
cites work: Computational problems associated with Racah algebra
cites work: The Computational Complexity of Continued Fractions
description: scientific article; zbMATH DE number 4145332