A subresultant-like theory for Buchberger's procedure
From MaRDI portal
Publication:2452291
Recommendations
- scientific article; zbMATH DE number 1263402
- Term cancellations in computing floating-point Gröbner bases
- On improving approximate results of Buchberger's algorithm by Newton's method
- Buchberger's algorithm: a constraint-based completion procedure
- A practical method for floating-point Gröbner basis computation
Cites work
- scientific article; zbMATH DE number 3857249 (Why is no real title available?)
- scientific article; zbMATH DE number 3913669 (Why is no real title available?)
- scientific article; zbMATH DE number 3922806 (Why is no real title available?)
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 1263402 (Why is no real title available?)
- A new efficient algorithm for computing Gröbner bases \((F_4)\)
- A practical method for floating-point Gröbner basis computation
- Floating-Point Gröbner Basis Computation with Ill-conditionedness Estimation
- Subresultants and Reduced Polynomial Remainder Sequences
- Term cancellations in computing floating-point Gröbner bases
- Theory of multiple polynomial remainder sequence
Cited in
(2)
This page was built for publication: A subresultant-like theory for Buchberger's procedure
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2452291)