GVW algorithm over principal ideal domains (Q2440326): Difference between revisions

The GVW algorithm, given by Gao, Wang, and Volny, for computing a Gröbner basis for an ideal in a polynomial ring, is known to be much faster and simpler than the algorithm F5. In this paper, the authors generalize the GVW algorithm and present an algorithm to compute a Gröbner basis for ideals when the coefficient ring is a principal ideal domain.