Buchberger's algorithm: Difference between revisions

Revision as of 10:26, 20 June 2022

Revision as of 08:04, 4 July 2022

Line 4:

[[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 ==