COMPUTATION OF QUASI-GROEBNER BASIS
Zhang Jing-liang · Journal of Mathematics · 2003
Let R be a domain, I be an ideal of the polynomial ringR[X, An algorithm for computing quasi-Groebner basis of I is given by giving the definition of S-Polynomial, and according to these results we can compute the dimension of I.