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...
Uložené v:
| Vydané v: | arXiv.org |
|---|---|
| Hlavný autor: | |
| Médium: | Paper |
| Jazyk: | English |
| Vydavateľské údaje: |
Ithaca
Cornell University Library, arXiv.org
03.12.2020
|
| Predmet: | |
| ISSN: | 2331-8422 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
Buďte prvý, kto okomentuje tento záznam!