Show simple item record

An Analysis of Improvements to Buchberger's Algorithm for Groebner Basis Computation

dc.contributor.advisorAdams, William W.en_US
dc.contributor.authorMcKay, Clinten_US
dc.description.abstractImprovements to Buchberger's Algorithm generally seek either to define a criterion for the removal of unnecessary S-pairs or to describe a strategy for improving the choices which one must make in the course of the algorithm. This paper surveys significant improvements to Buchberger's original algorithm for Groebner basis computation including the Gebauer-Moeller Criteria, the "Sugar" strategy, and Jean-Charles Faugere's F4 algorithm. Since Faugere's F4 is generally accepted as being a particularly efficient approach to Groebner basis computation, we test several variants of the F4 algorithm on a variety of benchmark ideals in an effort to judge the efficiency of the Groebner basis computation process, while also being mindful of the memory constraint issues occurring in computer algebra.en_US
dc.format.extent228987 bytes
dc.titleAn Analysis of Improvements to Buchberger's Algorithm for Groebner Basis Computationen_US
dc.contributor.publisherDigital Repository at the University of Marylanden_US
dc.contributor.publisherUniversity of Maryland (College Park, Md.)en_US
dc.subject.pquncontrolledGroebner Bases en_US
dc.subject.pquncontrolledBuchberger's Algorithmen_US

Files in this item


This item appears in the following Collection(s)

Show simple item record