Optimal Gröbner base algorithms for binomial ideals
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1254275
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals, and applications to commutative semigroups
- scientific article; zbMATH DE number 3941661
- scientific article; zbMATH DE number 3899033
- Efficient Gröbner bases computation over principal ideal rings
- scientific article; zbMATH DE number 1163420
- Gröbner bases and integer programming
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
- Fast Gröbner basis computation and polynomial reduction for generic bivariate ideals
Cited in
(7)- An optimal algorithm for constructing the reduced Gröbner basis of binomial ideals
- Improving the DISPGB algorithm using the discriminant ideal
- scientific article; zbMATH DE number 5375015 (Why is no real title available?)
- A superexponential lower bound for Gröbner bases and Church-Rosser commutative thue systems
- scientific article; zbMATH DE number 1254275 (Why is no real title available?)
- scientific article; zbMATH DE number 1254276 (Why is no real title available?)
- The complexity of the coverability, the containment, and the equivalence problems for commutative semigroups
This page was built for publication: Optimal Gröbner base algorithms for binomial ideals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4818838)