An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
DOI10.1006/jsco.1999.0285zbMath0951.13016OpenAlexW2028649275MaRDI QIDQ1974694
Ulla Koppenhagen, Ernst W. Mayr
Publication date: 8 May 2000
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jsco.1999.0285
reduced Gröbner basisbinomial idealfinitely presented commutative semigroupsexponential space algorithm
Commutative semigroups (20M14) Software, source code, etc. for problems pertaining to commutative algebra (13-04) Polynomial rings and ideals; rings of integer-valued polynomials (13F20) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)
Related Items (2)
Cites Work
- EUROSAM 84. International Symposium on Symbolic and Algebraic Computation, Cambridge, England, July 9-11, 1984. (Proceedings)
- Truncated Gröbner bases for integer programming
- 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
- An Algorithm to Calculate the Kernel of Certain Polynomial Ring Homomorphisms
- Proceedings of the first annual ACM symposium on Theory of computing - STOC '69
- Proceedings of the tenth annual ACM symposium on Theory of computing - STOC '78
- 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