pith. sign in

arxiv: 0901.1105 · v1 · submitted 2009-01-08 · 🧮 math.AC

Computing Inhomogeneous Groebner Bases

classification 🧮 math.AC
keywords basesgroebneralgorithmallowsbuchbergercenteredcomputationcomputing
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.