Modifying Faugère's F5 algorithm to ensure termination
From MaRDI portal
Publication:5175285
DOI10.1145/2016567.2016574zbMath1305.68353arXiv1006.0318OpenAlexW2043511512MaRDI QIDQ5175285
Justin Gash, John Perry, Christian Eder
Publication date: 20 February 2015
Published in: ACM Communications in Computer Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1006.0318
Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (6)
An analysis of inhomogeneous signature-based Gröbner basis computations ⋮ A survey on signature-based algorithms for computing Gröbner bases ⋮ Bounded regularity ⋮ A new algorithm for the generation of unitarity-compatible integration by parts relations ⋮ Termination of the F5 algorithm ⋮ On the complexity of the \(F_5\) Gröbner basis algorithm
Uses Software
This page was built for publication: Modifying Faugère's F5 algorithm to ensure termination
