On the complexity of computing the greatest common divisor of several univariate polynomials

DOI10.1007/3-540-59175-3_100OpenAlexW86548041MaRDI QIDQ5096342FDOQ5096342

Authors: Laureano Gonzalez-Vega 

Publication date: 16 August 2022

Published in: LATIN '95: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59175-3_100

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

Mathematics Subject Classification ID

Polynomials over commutative rings (13B25) Algorithmic information theory (Kolmogorov complexity, etc.) (68Q30) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Title not available (Why is that?)
• On computing the determinant in small parallel time using a small number of processors
• Title not available (Why is that?)
• Title not available (Why is that?)
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Theory of Subresultants
• A fast parallel algorithm to compute the rank of a matrix over an arbitrary field
• Parallel Algorithms for Algebraic Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Eine Verallgemeinerung des Sturmschen Wurzelzählverfahrens
• An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials
• Title not available (Why is that?)
• Spécialisation de la suite de Sturm et sous-résultants (I)
• Some Applications of Matrics in the Theory of Equations
• An extended polynomial GCD algorithm using Hankel matrices
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

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
• Title not available (Why is that?)
• Simultaneous elimination by using several tools from real algebraic geometry
• Complexity of algorithms for computing greatest common divisors of parametric univariate polynomials
• Title not available (Why is that?)
• Algorithms for computing greatest common divisors of parametric multivariate polynomials

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)