2020
DOI: 10.48550/arxiv.2012.02239
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

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

Alexander Maletzky

Abstract: We present a generic and executable formalization of signature-based algorithms (such as Faugère's F 5 ) for computing Gröbner bases, as well as their mathematical background, in the Isabelle/HOL proof assistant. Said algorithms are currently the best known algorithms for computing Gröbner bases in terms of computational efficiency. The formal development attempts to be as generic as possible, generalizing most known variants of signature-based algorithms, but at the same time the implemented functions are eff… Show more

Help me understand this report
View published versions

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 17 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?