Jump to content

Talk:Buchberger's algorithm

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by 62.214.243.240 (talk) at 20:11, 17 June 2006. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

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)[reply]