On Computing Janet Bases for Degree Compatible Orderings
Vladimir P. Gerdt, Yu. A. Blinkov · arXiv (Cornell University) · 2006
We consider three modifications of our involutive algorithm for computing Janet bases. These modifications are related to degree compatible monomial orders and specify selection strategies for non-multiplicative prolongations. By using the standard data base of polynomial benchmarks for \Gr bases software we compare the modifications and confront them with Magma that implements Faugère's $F_4$ algorithm.