An analysis of inhomogeneous signature-based Gröbner basis computations

DOI10.1016/j.jsc.2013.08.001zbMath1311.13037arXiv1203.6186OpenAlexW2073299143MaRDI QIDQ2437323

Christian Eder

Publication date: 3 March 2014

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1203.6186

zbMATH Keywords

Gröbner basissignature-based algorithmsF5GVWsugarG2VGVWHSsignature degreesugar degree

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items

On affine tropical F5 algorithms ⋮ 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

Uses Software

• PoSSo
• F5C

Cites Work

• F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
• Computing inhomogeneous Gröbner bases
• On the cancellation rule in the homogenization
• The F5 criterion revised
• A new incremental algorithm for computing Groebner bases
• Signature rewriting in gröbner basis computation
• Modifying Faugère's F5 algorithm to ensure termination
• Practical Gröbner basis computation
• Signature-based algorithms to compute Gröbner bases
• Unnamed Item
• Unnamed Item
• Unnamed Item