{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T02:00:22Z","timestamp":1760061622271,"version":"3.41.0"},"reference-count":14,"publisher":"Association for Computing Machinery (ACM)","issue":"1\/2","license":[{"start":{"date-parts":[[2013,7,15]],"date-time":"2013-07-15T00:00:00Z","timestamp":1373846400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Commun. Comput. Algebra"],"published-print":{"date-parts":[[2013,7,15]]},"abstract":"<jats:p>In this paper we describe a combination of ideas to improve incremental signature-based Gr\u00f6bner basis algorithms which have a big impact on their performance. Besides explaining how to combine already known optimizations to achieve more efficient algorithms, we show how to improve them even further. Although our idea has a postive effect on all kinds of incremental signature-based algorithms, the way this impact is achieved can be quite different. Based on the two best-known algorithms in this area, F5 and G2V, we explain our idea, both from a theoretical and a practical point of view.<\/jats:p>","DOI":"10.1145\/2503697.2503699","type":"journal-article","created":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T18:06:45Z","timestamp":1373998005000},"page":"1-13","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving incremental signature-based Gr\u00f6bner basis algorithms"],"prefix":"10.1145","volume":"47","author":[{"given":"Christian","family":"Eder","sequence":"first","affiliation":[{"name":"TU Kaiserslautern, Kaiserslautern, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7,15]]},"reference":[{"unstructured":"Arri A. and Perry J. The F5 Criterion revised. 2011. http:\/\/arxiv.org\/abs\/1012.3664v3.  Arri A. and Perry J. The F5 Criterion revised. 2011. http:\/\/arxiv.org\/abs\/1012.3664v3.","key":"e_1_2_1_1_1"},{"volume-title":"University of Innsbruck","year":"1965","author":"Buchberger B.","key":"e_1_2_1_2_1"},{"unstructured":"Decker W. Greuel G.-M. Pfister G. and Sch\u00f6nemann H. Singular 3-1-5 --- A computer algebra system for polynomial computations 2012. http:\/\/www.singular.uni-kl.de.  Decker W. Greuel G.-M. Pfister G. and Sch\u00f6nemann H. Singular 3-1-5 --- A computer algebra system for polynomial computations 2012. http:\/\/www.singular.uni-kl.de.","key":"e_1_2_1_3_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.1145\/2016567.2016574"},{"doi-asserted-by":"publisher","key":"e_1_2_1_5_1","DOI":"10.1016\/j.jsc.2010.06.019"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1145\/1993886.1993906"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.1145\/780506.780516"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.1145\/1837934.1837944"},{"doi-asserted-by":"crossref","unstructured":"Gao S. Volny IV F. and Wang D. A new algorithm for computing Gr\u00f6bner bases. 2010.  Gao S. Volny IV F. and Wang D. A new algorithm for computing Gr\u00f6bner bases. 2010.","key":"e_1_2_1_9_1","DOI":"10.1145\/1837934.1837944"},{"doi-asserted-by":"publisher","key":"e_1_2_1_10_1","DOI":"10.1016\/S0747-7171(88)80048-8"},{"unstructured":"Greuel G.-M. and Pfister G. A Singular Introduction to Commutative Algebra. Springer Verlag 2nd edition 2007.   Greuel G.-M. and Pfister G. A Singular Introduction to Commutative Algebra. Springer Verlag 2nd edition 2007.","key":"e_1_2_1_11_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_12_1","DOI":"10.1145\/1088261.1088267"},{"unstructured":"Stegers T. Faug\u00e0re's F5 Algorithm revisited. Master's thesis Technische Univerit\u00e4t Darmstadt revised version 2007.  Stegers T. Faug\u00e0re's F5 Algorithm revisited. Master's thesis Technische Univerit\u00e4t Darmstadt revised version 2007.","key":"e_1_2_1_13_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_14_1","DOI":"10.1145\/1993886.1993936"}],"container-title":["ACM Communications in Computer Algebra"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503697.2503699","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2503697.2503699","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:49Z","timestamp":1750235749000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2503697.2503699"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,15]]},"references-count":14,"journal-issue":{"issue":"1\/2","published-print":{"date-parts":[[2013,7,15]]}},"alternative-id":["10.1145\/2503697.2503699"],"URL":"https:\/\/doi.org\/10.1145\/2503697.2503699","relation":{},"ISSN":["1932-2240"],"issn-type":[{"type":"print","value":"1932-2240"}],"subject":[],"published":{"date-parts":[[2013,7,15]]},"assertion":[{"value":"2013-07-15","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}