Analysis of Euclidean algorithms for polynomials over finite fields (Q912620): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factoring Polynomials Over Large Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast parallel matrix and GCD computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4151157 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Euclid's Algorithm and the Theory of Subresultants / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for Factoring Polynomials Over Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subresultants and Reduced Polynomial Remainder Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computing Time of the Euclidean Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The number of steps in the Euclidean algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Algebraic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representations and Parallel Computations for Rational Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5613266 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of parenthesis languages / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclid's Algorithm for Large Numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4146667 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of GCDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Algorithms in Finite Fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast computation of continued fraction expansions. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational problems associated with Racah algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Computational Complexity of Continued Fractions / rank
 
Normal rank

Latest revision as of 15:31, 20 June 2024

scientific article
Language Label Description Also known as
English
Analysis of Euclidean algorithms for polynomials over finite fields
scientific article

    Statements

    Analysis of Euclidean algorithms for polynomials over finite fields (English)
    0 references
    0 references
    0 references
    1990
    0 references
    0 references
    indeterminate shift Euclidean algorithm
    0 references
    factor shift Euclidean algorithm
    0 references
    subtractive indeterminate shift algorithm
    0 references
    subtractive linear factor shift algorithm
    0 references