On the complexity of computing the greatest common divisor of several univariate polynomials
From MaRDI portal
Publication:5096342
Recommendations
- Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
- Algorithms for computing greatest common divisors of parametric multivariate polynomials
- scientific article; zbMATH DE number 799777
- On approximate GCDs of univariate polynomials
- Toward the best algorithm for approximate GCD of univariate polynomials
- The numerical greatest common divisor of univariate polynomials
- On the complexity of multivariate polynomial division
- On computation of the greatest common divisor of several polynomials over a finite field.
- scientific article; zbMATH DE number 1113848
- Irreducibility and greatest common divisor algorithms for sparse polynomials
Cites work
- scientific article; zbMATH DE number 3839766 (Why is no real title available?)
- scientific article; zbMATH DE number 3922806 (Why is no real title available?)
- scientific article; zbMATH DE number 3785018 (Why is no real title available?)
- scientific article; zbMATH DE number 42630 (Why is no real title available?)
- scientific article; zbMATH DE number 52177 (Why is no real title available?)
- scientific article; zbMATH DE number 5269 (Why is no real title available?)
- scientific article; zbMATH DE number 3296355 (Why is no real title available?)
- scientific article; zbMATH DE number 3303655 (Why is no real title available?)
- scientific article; zbMATH DE number 3334251 (Why is no real title available?)
- scientific article; zbMATH DE number 3355217 (Why is no real title available?)
- A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- An extended polynomial GCD algorithm using Hankel matrices
- Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
- On Euclid's Algorithm and the Theory of Subresultants
- On computing the determinant in small parallel time using a small number of processors
- Parallel Algorithms for Algebraic Problems
- Some Applications of Matrics in the Theory of Equations
- Spécialisation de la suite de Sturm et sous-résultants (I)
- Subresultants and Reduced Polynomial Remainder Sequences
Cited in
(12)- On the greatest common divisor of two univariate polynomials. II
- Certified Hermite Matrices from Approximate Roots - Univariate Case
- An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
- Irreducibility and greatest common divisor algorithms for sparse polynomials
- On computation of the greatest common divisor of several polynomials over a finite field.
- Greatest common divisors of polynomials given by straight-line programs
- An algorithm for searching the greatest common divisor for Ore polynomials with polynomial coefficients depending on a parameter
- scientific article; zbMATH DE number 1113848 (Why is no real title available?)
- Simultaneous elimination by using several tools from real algebraic geometry
- Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
- Algorithms for computing greatest common divisors of parametric multivariate polynomials
- scientific article; zbMATH DE number 1981162 (Why is no real title available?)
This page was built for publication: On the complexity of computing the greatest common divisor of several univariate polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5096342)
