Gröbner bases
Revision as of 10:56, 10 October 2022 by Admin (talk | contribs) (Created page with "== Problem Description== In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring K[x1, ..,xn] over a field K. == Bounds Chart == 1050px == Step Chart == 1050px == Improvement Table == {| class="wikitable" style="text-align:center;...")
Problem Description
In mathematics, and more specifically in computer algebra, computational algebraic geometry, and computational commutative algebra, a Gröbner basis is a particular kind of generating set of an ideal in a polynomial ring K[x1, ..,xn] over a field K.
Bounds Chart
Step Chart
Improvement Table
| Complexity Classes | Algorithm Paper Links | Lower Bounds Paper Links |
|---|---|---|
| Exp/Factorial | Buchberger's algorithm (1976) | |
| Polynomial > 3 | Faugère F4 algorithm (1999) | |
| Cubic | ||
| Quadratic | ||
| nlogn | ||
| Linear | ||
| logn |