An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups (Q5928894)

From MaRDI portal
scientific article; zbMATH DE number 1584497
Language Label Description Also known as
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
    0 references
    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
    0 references
    0 references
    0 references
    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