Theory of multiple polynomial remainder sequence

DOI10.2977/prims/1195181611zbMath0594.13001OpenAlexW2060168889MaRDI QIDQ1076728

Tateaki Sasaki, Akio Furukawa

Publication date: 1984

Published in: Publications of the Research Institute for Mathematical Sciences, Kyoto University (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2977/prims/1195181611

zbMATH Keywords

algorithmsmultiple polynomial remainder sequence

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20)

Related Items (3)

A Bridge between Euclid and Buchberger: (An Attempt to Enhance Gröbner Basis Algorithm by PRSs and GCDs) ⋮ A subresultant-like theory for Buchberger's procedure ⋮ Cramer-type formula for the polynomial solutions of coupled linear equations with polynomial coefficients

Cites Work

• Unnamed Item
• Unnamed Item
• The Subresultant PRS Algorithm
• Polynomial Remainder Sequences and Determinants
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Theory of Subresultants

This page was built for publication: Theory of multiple polynomial remainder sequence