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 Geometry guy (talk | contribs) at 20:07, 13 May 2007 (add maths rating with field and importance using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
WikiProject iconMathematics Unassessed Mid‑priority
WikiProject iconThis article is within the scope of WikiProject Mathematics, a collaborative effort to improve the coverage of mathematics on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.MathematicsWikipedia:WikiProject MathematicsTemplate:WikiProject Mathematicsmathematics
???This article has not yet received a rating on Wikipedia's content assessment scale.
MidThis article has been rated as Mid-priority on the project's priority scale.

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]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Buchberger%27s_algorithm&oldid=130606516"