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

DOI10.1006/jsco.1999.1015zbMath0984.13020OpenAlexW2047364668MaRDI QIDQ5928894

Ulla Koppenhagen, Ernst W. Mayr

Publication date: 26 April 2002

Published in: Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jsco.1999.1015

zbMATH Keywords

complexityGröbner basisbinomial idealenumeration problemPetri netsword problem

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Related Items (max. 100)

Complexity of Membership Problems of Different Types of Polynomial Ideals ⋮ Counting solutions to binomial complete intersections

Cites Work

• The complexity of the word problems for commutative semigroups and polynomial ideals
• Binomial ideals
• Resolution of singularities of an algebraic variety over a field of characteristic zero. I
• The Structure of Polynomial Ideals and Gröbner Bases
• A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
• Admissible orders and linear forms
• The Complexity of the Finite Containment Problem for Petri Nets
• The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
• Parallelism in random access machines
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups