Content deleted Content added
→top: less pedantic |
→top: Improving |
||
Line 1:
{{Short description|Algorithm for computing Gröbner bases}}
In the theory of [[multivariate polynomial]]s, '''Buchberger's algorithm''' is a method
[[Euclidean algorithm]] for polynomial [[Greatest common divisor]] computation and [[Gaussian elimination]] of [[system of linear equations|linear system]]s are special cases of Buchberger's algorithm when the number of variables or the degrees of the polynomials are respectively equal to one.
For other Gröbner basis algorithms, see ((slink|Gröbner basis#Algorithms and implementations}}.
== Algorithm ==
|