@inproceedings{bea4e6932f98471d8ea280f4da767171,
title = "Optimal gr{\"o}bner base algorithms for binomial ideals",
abstract = "Little is known about upper complexity bounds for the normal form algorithms which transform a given polynomial ideal basis into a Gr{\"o}bner basis. In this paper, we exhibit an optimal, exponential space algorithm for generating the reduced Gr{\"o}bner basis of binomial ideals. This result is then applied to derive space optimal decision procedures for the finite enumeration and subword problems for commutative semigroups.",
author = "Ulla Koppenhagen and Mayr, {Ernst W.}",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1996.; 23rd International Colloquium on Automata, Languages, and Programming, ICALP 1996 ; Conference date: 08-07-1996 Through 12-07-1996",
year = "1996",
doi = "10.1007/3-540-61440-0_132",
language = "English",
isbn = "3540614400",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "244--255",
editor = "{Meyer auf der Heide}, Friedhelm and Burkhard Monien",
booktitle = "Automata, Languages and Programming - 23rd International Colloquium, ICALP 1996, Proceedings",
}