Groebner_Bases
From MaRDI portal
Groebner Bases
- A machine-checked implementation of Buchberger's algorithm
- A new efficient algorithm for computing Gröbner bases (F₄)
- A verified common lisp implementation of Buchberger's algorithm in ACL2
- An algorithm for finding the basis elements of the residue class ring of a zero dimensional polynomial ideal
- An introduction to commutative and noncommutative Gröbner bases
- Certifying properties of an efficient functional program for computing Gröbner bases
- Context Aware Calculation and Deduction
- Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Mathematical Knowledge Management
- Mathematical theory exploration in Theorema: reduction rings
Cited in
(9)- Gröbner bases of modules and Faugère's F₄ algorithm in Isabelle/HOL
- Formalization of Dubé's degree bounds for Gröbner bases in Isabelle/HOL
- Jordan Normal Forms
- Deep_Learning
- Polynomials
- Group-Ring-Module
- Matrix_Tensor
- A formal proof of the expressiveness of deep learning
- A formal proof of the expressiveness of deep learning
This page was built for software: Groebner_Bases
