Primitive polynomial remainder sequences in elimination theory

DOI10.1007/BF01225644zbMath0845.12006MaRDI QIDQ1343108

Michael Kalkbrener

Publication date: 31 January 1995

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

zbMATH Keywords

multivariate polynomialspolynomial equationselimination sequence

Mathematics Subject Classification ID

Related Items (1)

Multiplicity-preserving triangular set decomposition of two polynomials

Uses Software

• CASA
• Maple

Cites Work

• Ideal basis and primary decompositions: case of two variables
• The Subresultant PRS Algorithm
• A Neural Network Modeled by an Adaptive Lotka-Volterra System
• Subresultants and Reduced Polynomial Remainder Sequences
• On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
• On Euclid's Algorithm and the Theory of Subresultants
• The Calculation of Multivariate Polynomial Resultants
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Primitive polynomial remainder sequences in elimination theory