 The computational complexity of the whole computation depends mainly on the regularity, which is the degree of the numerator of the Hilbert series.In fact the Gröbner basis may be computed by linear algebra over the polynomials of degree bounded by the regularity.The computation of Hilbert series and Hilbert polynomials are available in most computer algebra systems.