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

DOI10.1007/BF03167202zbMATH Open0796.12007MaRDI QIDQ689905FDOQ689905

Authors: Masayuki Suzuki 

Publication date: 29 September 1994

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

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

zbMATH Keywords

multivariable polynomialspolynomial GCDpolynomial remainder sequence

Mathematics Subject Classification ID

Computational number theory (11Y99)

Cites Work

• Title not available (Why is that?)
• The Subresultant PRS Algorithm
• On Euclid's Algorithm and the Theory of Subresultants
• On Hensel factorization. I
• Polynomial Remainder Sequences and Determinants
• Three new algorithms for multivariate polynomial GCD
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• Title not available (Why is that?)
• Title not available (Why is that?)
• The EEZ-GCD algorithm
• Title not available (Why is that?)

Cited In (2)

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

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)