Computing Inhomogeneous Groebner Bases
A. M. Bigatti, M. Caboara, L. Robbiano
TL;DR
This paper introduces a novel approach using self-saturation to improve the efficiency of computing Groebner bases with Buchberger's Algorithm.
Contribution
It presents a new method leveraging self-saturation to enhance Groebner basis computation efficiency.
Findings
Faster computation times for Groebner bases
Reduced complexity in Buchberger's Algorithm
Improved algorithmic stability
Abstract
In this paper we describe how an idea centered on the concept of self-saturation allows several improvements in the computation of Groebner bases via Buchberger's Algorithm.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPolynomial and algebraic computation · Cryptography and Residue Arithmetic · Commutative Algebra and Its Applications