Role of involutive criteria in computing Boolean Gröbner bases
Vladimir P. Gerdt, M. V. Zinin · Programming and Computer Software · 2009
In this paper, effectiveness of using four criteria in an involutive algorithm based on the Pommaret division for construction of Boolean Gröbner bases is studied. One of the results of this study is the observation that the role of the criteria in computations in Boolean rings is much less than that in computations in an ordinary ring of polynomials over the field of integers. Another conclusion of this study is that the efficiency of the second and/or third criteria is higher than that of the two others.