Effectiveness of involutive criteria in computation of polynomial Janet bases
Vladimir P. Gerdt, Denis A. Yanovich · Programming and Computer Software · 2006
In this paper, effectiveness of involutive criteria in the elimination of useless prolongations when computing polynomial Janet bases, which are typical representatives of involutive bases, is discussed. One of the results of this study is that the role of the criteria in an involutive algorithm is not as important as in the Buchberger algorithm. It is shown also that these criteria affect the growth of intermediate coefficients.