A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases
Akira Suzuki, Yosuke Sato · 2006
We introduce a simple algorithm to compute comprehensive Gröbner bases. It requires only computations of reduced Gröbner bases in polynomial rings over ground fields. It is so simple that we can easily implement it on any computer algebra system that has a routine to compute reduced Gröbner bases. Our implementations on several computer algebra systems show that it is also sufficiently fast comparing with other existing algorithms.