scientific article; zbMATH DE number 3631929

MaRDI QIDQ4192968zbMATH OpenFDO

Authors Anthony C. Hearn

Publication date 1979

zbMATH Keywords

AlgorithmGreatest Common DivisorMultivariate PolynomialNon-Modular Computation

Mathematics Subject Classification ID

Polynomials in general fields (irreducibility, etc.) (12E05) Algorithms in computer science (68W99)

Cited in

(6)

• Theory of multiple polynomial remainder sequence
• GCDHEU: Heuristic polynomial GCD algorithm based on integer GCD computation
• Three new algorithms for multivariate polynomial GCD
• Primitive polynomial remainder sequences in elimination theory
• A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs)
• Improvements of the power-series coefficient polynomial remainder sequence GCD algorithm

This page was built for publication:

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