Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm

DOI10.1007/BF03167202MaRDI QIDQ689905zbMATH OpenFDO

Authors Masayuki Suzuki

Publication date 29 September 1994

Published in Japan Journal of Industrial and Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

multivariable polynomialspolynomial GCDpolynomial remainder sequence

Mathematics Subject Classification ID

Computational number theory (11Y99)

Recommendations

• Three new algorithms for multivariate polynomial GCD
• scientific article; zbMATH DE number 1574467
• scientific article; zbMATH DE number 1303539
• Fast computation of GCDs
• scientific article; zbMATH DE number 4049035

Cites work

• scientific article; zbMATH DE number 3913669 (Why is no real title available?)
• scientific article; zbMATH DE number 3936514 (Why is no real title available?)
• scientific article; zbMATH DE number 3631929 (Why is no real title available?)
• scientific article; zbMATH DE number 3026247 (Why is no real title available?)
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants
• On Hensel factorization. I
• Polynomial Remainder Sequences and Determinants
• The EEZ-GCD algorithm
• The Subresultant PRS Algorithm
• Three new algorithms for multivariate polynomial GCD

Cited in

(2)

• An improved EZ-GCD algorithm for multivariate polynomials
• Three new algorithms for multivariate polynomial GCD

Describes a project that uses

Uses Software

• REDUCE

This page was built for publication: Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q689905)