F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
From MaRDI portal
Publication:607065
DOI10.1016/j.jsc.2010.06.019zbMath1227.13018arXiv0906.2967OpenAlexW1993995116MaRDI QIDQ607065
Publication date: 19 November 2010
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0906.2967
Software, source code, etc. for problems pertaining to commutative algebra (13-04) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (29)
An improvement for GVW ⋮ The F5 algorithm in Buchberger's style ⋮ A new framework for computing Gröbner bases ⋮ Syzygies probing scattering amplitudes ⋮ A new proof for the correctness of the F5 algorithm ⋮ Invariant \(\mathrm G^2\mathrm V\) algorithm for computing SAGBI-Gröbner bases ⋮ Computing coupled border bases ⋮ A signature-based algorithm for computing the nondegenerate locus of a polynomial system ⋮ Resultant elimination via implicit equation interpolation ⋮ Further perspectives on elimination ⋮ Elliptic curve discrete logarithm problem over small degree extension fields ⋮ Applying IsRewritten criterion on Buchberger algorithm ⋮ Involutive bases algorithm incorporating F\(_5\) criterion ⋮ An analysis of inhomogeneous signature-based Gröbner basis computations ⋮ GVW algorithm over principal ideal domains ⋮ A survey on signature-based algorithms for computing Gröbner bases ⋮ Generalization of the F5 algorithm for calculating Gröbner bases for polynomial ideals ⋮ Resolvability of Hamming Graphs ⋮ Proof of the Faugère criterion for the F5 algorithm ⋮ Speeding up the GVW algorithm via a substituting method ⋮ Bounded regularity ⋮ An improvement over the GVW algorithm for inhomogeneous polynomial systems ⋮ On the use of Buchberger criteria in \(\mathrm G^2\mathrm V\) algorithm for calculating Gröbner bases ⋮ Termination of the F5 algorithm ⋮ A generic and executable formalization of signature-based Gröbner basis algorithms ⋮ A Variant of the F4 Algorithm ⋮ A signature-based algorithm for computing Gröbner bases over principal ideal domains ⋮ A new signature-based algorithms for computing Gröbner bases ⋮ Simple signature based iterative algorithm for calculation of Gröbner bases
Uses Software
Cites Work
This page was built for publication: F5C: A variant of Faugère's F5 algorithm with reduced Gröbner bases
