4 citations · 5 across the 3 of their papers we have counts for
Showing cs.SCShow all
2 papers · 1 filter
cs.SC2020★ 4 cited
A Generic and Executable Formalization of Signature-Based Gröbner Basis Algorithms
Alexander Maletzky
We present a generic and executable formalization of signature-based algorithms (such as Faugère's ) for computing Gröbner bases, as well as their mathematical background, in…
cs.SC2016
Verifying Buchberger's Algorithm in Reduction Rings
Alexander Maletzky
In this paper we present the formal, computer-supported verification of a functional implementation of Buchberger's critical-pair/completion algorithm for computing Gröbner bases i…