Talk:Buchberger's algorithm

From Wikipedia, the free encyclopedia

Mathematics Portal This article is within the scope of WikiProject Mathematics, which collaborates on articles related to mathematics.
Mathematics rating:	Start Class	Mid Priority	Field: Algebra
Please update this rating as the article progresses, or if the rating is inaccurate. Click to show/hide comments. Please add to or update the comments to suggest improvements to the article. Some clean-up needed, and sectioning. However, the length is about right. Close to B class. Arcfrk 02:38, 24 May 2007 (UTC)

The remark that Buchberger's algorithm is (not considering any refinements thereof) the only known way to compute Groebner bases is not correct.

Another approach that has been implemented (and that has been found to be very competitive in terms of running time) is based on the concept of involutive bases. The latter are based on ideas from differential algebra, in particular on work from the french mathematician Riquier. Involutive bases have been investigated, among others, by Gerdt and Blinkov.

62.214.243.240 20:11, 17 June 2006 (UTC)