An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals - researchr publication related

researchr

You are not signed in
Sign in
Sign up

Ulla Koppenhagen, Ernst W. Mayr. An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals. In ISSAC. pages 55-62, 1996. [doi]

The following publications are possibly variants of this publication:

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial IdealsUlla Koppenhagen, Ernst W. Mayr. JSC, 28(3):317-338, 1999.

An Optimal Algorithm for Constructing the Reduced Gröbner Basis of Binomial Ideals, and Applications to Commutative SemigroupsUlla Koppenhagen, Ernst W. Mayr. JSC, 31(1/2):259-276, 2001.

Optimal Gröbner Base Algorithms for Binomial IdealsUlla Koppenhagen, Ernst W. Mayr. icalp 1996: 244-255

Optimal algorithms for binomial ideals and commutative semigroupsUlla Koppenhagen. PhD thesis, Technical University Munich, 1997. [doi]

runs on WebDSL