An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups (Q5928894)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1584497
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups |
scientific article; zbMATH DE number 1584497 |
Statements
An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups (English)
0 references
26 April 2002
0 references
This paper is on complexity theory. The authors discuss the complexity of computing Gröbner bases of binomial ideals. Applications are given to enumeration problems and subword problems.
0 references
Gröbner basis
0 references
binomial ideal
0 references
complexity
0 references
Petri nets
0 references
enumeration problem
0 references
word problem
0 references
0 references
0 references
0 references
