Returns a Groebner basis of an ideal or module with respect to the monomial
ordering of the basering (which has to be global).
Note:
The algorithm is designed to keep polynomials slim (short with small coefficients). For details see http://www.mathematik.uni-kl.de/~zca/Reports_on_ca/35/paper_35_full.ps.gz.
A reduced Groebner basis is returned if option(redSB) is set
(see option(redSB)).
To view the progress of long running computations, use option(prot)
(see option(prot)).
Warning:
Groebner basis computations with inexact coefficients can not be trusted due to rounding errors.