arXiv · math/0603161
On Computing Janet Bases for Degree Compatible Orderings
Abstract
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.
Explore related subjects
Keep this discovery
Vladimir P. Gerdt, Yuri A. Blinkov. 2006-04-10. On Computing Janet Bases for Degree Compatible Orderings. https://arxiv.org/abs/math/0603161
Cite the original work for its findings. Save a collection to share your selection of sources.