Space-efficient Gröbner basis computation without degree bounds
Ernst W Mayr, Stephan Ritscher · 2011
The computation of a Gröbner basis of a polynomial ideal is known to be exponential space complete. We revisit the algorithm by Kühnle and Mayr using recent improvements of various degree bounds. The result is an algorithm which is exponential in the ideal dimension (rather than the number of indeterminates).