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

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

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

Mathematics Subject Classification ID

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

Related Items (3)

Simultaneous elimination by using several tools from real algebraic geometry ⋮ An elementary proof of Barnett's theorem about the greatest common divisor of several univariate polynomials ⋮ Certified Hermite Matrices from Approximate Roots - Univariate Case

Cites Work

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

This page was built for publication: On the complexity of computing the greatest common divisor of several univariate polynomials