Practical Gröbner basis computation
From MaRDI portal
Publication:5244536
DOI10.1145/2442829.2442860zbMath1308.68185arXiv1206.6940OpenAlexW2035842864MaRDI QIDQ5244536
Bjarke Hammersholt Roune, Michael Stillman
Publication date: 27 March 2015
Published in: Proceedings of the 37th International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1206.6940
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (12)
Signature Gröbner bases, bases of syzygies and cofactor reconstruction in the free algebra ⋮ Syzygies probing scattering amplitudes ⋮ A signature-based algorithm for computing the nondegenerate locus of a polynomial system ⋮ Axioms for a theory of signature bases ⋮ An analysis of inhomogeneous signature-based Gröbner basis computations ⋮ A survey on signature-based algorithms for computing Gröbner bases ⋮ Speeding up the GVW algorithm via a substituting method ⋮ An improvement over the GVW algorithm for inhomogeneous polynomial systems ⋮ Termination of the F5 algorithm ⋮ A generic and executable formalization of signature-based Gröbner basis algorithms ⋮ A signature-based algorithm for computing Gröbner bases over principal ideal domains ⋮ Simple signature based iterative algorithm for calculation of Gröbner bases
Uses Software
This page was built for publication: Practical Gröbner basis computation
