Buchberger Algorithm

An algorithm that constructs a Gröbner basis from a given finite generating set of a polynomial ideal by iteratively forming S-polynomials of pairs of generators and reducing them modulo the current set until all S-polynomials reduce to zero; termination (over a field with a monomial order) yields a Gröbner basis.