{"id":{"repo_id":"maryland","oai_identifier":"oai:drum.lib.umd.edu:1903/2119"},"canonical_url":"https://search.dev.ndltd.org/etd/maryland/oai:drum.lib.umd.edu:1903/2119","repository":{"repo_id":"maryland","name":"University of Maryland","base_url":"https://api.drum.lib.umd.edu/server/oai/request"},"display":{"title":"An Analysis of Improvements to Buchberger's Algorithm for Groebner Basis Computation","abstract":"Improvements 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.","abstract_html":"Improvements 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.","abstract_has_math":false,"creators":["McKay, Clint"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Mathematics","school":null,"contributors":[],"advisors":["Adams, William W."],"committee_chairs":[],"committee_members":[],"year":2004,"date_issued":"2004-12-06","date_published":"2004-12-06","updated_at":"2026-07-24T03:02:15Z","subjects":[],"languages":["en_US"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1903/2119","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.advisor","label":"Advisor","values":["Adams, William W."]},{"key":"dc:contributor.department","label":"Department","values":["Mathematics"]},{"key":"dc:creator","label":"Author","values":["McKay, Clint"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2005-02-02T06:48:55Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2005-02-02T06:48:55Z"]},{"key":"dc:date.issued","label":"Date","values":["2004-12-06"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en_US"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1903/2119"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["Improvements 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."]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["An Analysis of Improvements to Buchberger's Algorithm for Groebner Basis Computation"]}]}],"canonical_facts":{"dc:contributor.advisor":["Adams, William W."],"dc:contributor.department":["Mathematics"],"dc:creator":["McKay, Clint"],"dc:date.accessioned":["2005-02-02T06:48:55Z"],"dc:date.available":["2005-02-02T06:48:55Z"],"dc:date.issued":["2004-12-06"],"dc:description.abstract":["Improvements 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."],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1903/2119"],"dc:language.iso":["en_US"],"dc:title":["An Analysis of Improvements to Buchberger's Algorithm for Groebner Basis Computation"],"dc:type":["Thesis"]},"updated_at":"2026-07-24T03:02:15Z"}