An improved EZ-GCD algorithm for multivariate polynomials

DOI10.1016/j.jsc.2008.04.006zbMath1156.13013OpenAlexW1979661203MaRDI QIDQ2518611

Kuniaki Tsuji

Publication date: 16 January 2009

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jsc.2008.04.006

zbMATH Keywords

Bad-zero problemEz-GCD

Mathematics Subject Classification ID

Computational aspects and applications of commutative rings (13P99)

Related Items (2)

A fast parallel sparse polynomial GCD algorithm ⋮ On the extended Hensel construction and its application to the computation of real limit points

Cites Work

• Three new algorithms for multivariate polynomial GCD
• The EEZ-GCD algorithm
• An Improved Multivariate Polynomial Factoring Algorithm
• Polynomial Remainder Sequences and Determinants
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Theory of Subresultants
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An improved EZ-GCD algorithm for multivariate polynomials