Generalized Reduction to Compute Toric Ideals

Authors:
Deepanjan Kesh;Shashank K. Mehta
Affiliations:
Indian Institute of Technology, Kanpur, India 208016;Indian Institute of Technology, Kanpur, India 208016
Venue:
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Year:
2009

Citing 8
Cited 1

On the complexity of computing syzygies

Journal of Symbolic Computation
An algebraic geometry algorithm for scheduling in presence of setups and correlated demands

Mathematical Programming: Series A and B
A Variant of the Buchberger Algorithm for Integer Programming

SIAM Journal on Discrete Mathematics
Computing toric ideals

Journal of Symbolic Computation
Buchberger Algorithm and Integer Programming

AAECC-9 Proceedings of the 9th International Symposium, on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
A theoretical basis for the reduction of polynomials to canonical forms

ACM SIGSAM Bulletin
Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)

Ideals, Varieties, and Algorithms: An Introduction to Computational Algebraic Geometry and Commutative Algebra, 3/e (Undergraduate Texts in Mathematics)
Computing generating sets of lattice ideals and Markov bases of lattices

Journal of Symbolic Computation

A saturation algorithm for homogeneous binomial ideals

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Toric ideals have many applications including solving integer programs. Several algorithms for computing the toric ideal of an integer matrix are available in the literature. Since it is an NP hard problem the present approaches can only solve relatively small problems. We propose a new approach which improves upon a well known saturation technique.