Revision as of 23:08, 25 August 2004 edit Michael Hardy (talk \| contribs) Administrators 210,577 edits mNo edit summary ← Previous edit		Revision as of 23:16, 25 August 2004 edit undo Michael Hardy (talk \| contribs) Administrators 210,577 edits No edit summary Next edit →
Line 1: In computational [[~~algebraic_geometry\|~~algebraic geometry]], '''Buchberger's algorithm''' is a method of transforming a given set of generators for a polynomial [[ring ideal\|ideal]] into a [[~~Gröbner_basis\|~~Gröbner basis]] with respect to some [[~~monomial_order\|~~monomial order]]. A crude version of this algorithm proceeds as follows:

Buchberger's algorithm: Difference between revisions