Revision as of 18:34, 28 December 2004 edit Crust (talk \| contribs) Extended confirmed users 1,898 edits m the informal use of "resultant" was potentially confusing ← Previous edit		Revision as of 08:56, 5 March 2005 edit undo Tabletop (talk \| contribs) Extended confirmed users, Pending changes reviewers 177,774 edits m Category:Algebra Next edit →
Line 14: We are consistently increasing the size of the monomial ideal generated by the leading terms of our set ''F'', and [[Dickson's lemma]] (or the [[Hilbert basis theorem]]) guarantees that any such ascending chain must eventually become constant. Therefore this algorithm does indeed stop. Unfortunately, it may take a very long time to terminate, corresponding to the fact that Gröbner bases can be ''extremely'' large. [[Category:Algebra]]

Buchberger's algorithm: Difference between revisions