On the complexity of computing the greatest common divisor of several univariate polynomials (Q5096342): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3992490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the determinant in small parallel time using a small number of processors / 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: Q3309525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5629775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5579582 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subresultants and Reduced Polynomial Remainder Sequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms for Algebraic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spécialisation de la suite de Sturm et sous-résultants (I) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5611839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extended polynomial GCD algorithm using Hankel matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4712966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Applications of Matrics in the Theory of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002529 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3963114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast parallel algorithm to compute the rank of a matrix over an arbitrary field / rank
 
Normal rank

Latest revision as of 22:19, 29 July 2024

scientific article; zbMATH DE number 7572153
Language Label Description Also known as
English
On the complexity of computing the greatest common divisor of several univariate polynomials
scientific article; zbMATH DE number 7572153

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references