Simple signature based iterative algorithm for calculation of Gr\"obner bases
Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2013), pp. 20-25
Voir la notice de l'article provenant de la source Math-Net.Ru
This paper presents an algorithm for computing Groebner bases based upon labeled polynomials from the algorithm F5. The main highlight of this algorithm compared with analogues is the simplicity both of the algorithm and of its correctness proof achieved without loss of efficiency. This leads to a simple implementation which performance is in par with more complex analogues.
@article{VMUMM_2013_5_a2,
author = {V. V. Galkin},
title = {Simple signature based iterative algorithm for calculation of {Gr\"obner} bases},
journal = {Vestnik Moskovskogo universiteta. Matematika, mehanika},
pages = {20--25},
publisher = {mathdoc},
number = {5},
year = {2013},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/VMUMM_2013_5_a2/}
}
TY - JOUR AU - V. V. Galkin TI - Simple signature based iterative algorithm for calculation of Gr\"obner bases JO - Vestnik Moskovskogo universiteta. Matematika, mehanika PY - 2013 SP - 20 EP - 25 IS - 5 PB - mathdoc UR - http://geodesic.mathdoc.fr/item/VMUMM_2013_5_a2/ LA - ru ID - VMUMM_2013_5_a2 ER -
V. V. Galkin. Simple signature based iterative algorithm for calculation of Gr\"obner bases. Vestnik Moskovskogo universiteta. Matematika, mehanika, no. 5 (2013), pp. 20-25. http://geodesic.mathdoc.fr/item/VMUMM_2013_5_a2/