Optimal Gröbner Base Algorithms for Binomial Ideals

Document type:: Technical Report
Author(s):: Ulla Koppenhagen; Ernst W. Mayr
Title:: Optimal Grö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 Gröbner basis. In this paper, we exhibit an optimal, exponential space algorithm for generating the reduced Grö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.
Keywords:: Finite Enumeration Problem; Subword Problem; Computational Complexity
Year:: 1996
Year / month:: 1996-01-01 00:00:00
Pages:: 18
BibTeX

Occurrences: