A Generic and Executable Formalization of Signature-Based Gröbner Basis Algorithms

We present a generic and executable formalization of signature-based algorithms (such as Faugère's \(F_5\)) for computing Gr\"obner bases, as well as their mathematical background, in the Isabelle/HOL proof assistant. Said algorithms are currently the best known algorithms for computing Gr...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Author:	Maletzky, Alexander
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 03.12.2020
Subjects:	Algorithms
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!