Generalized Reduction to Compute Toric Ideals

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.

• Type: Conference
• Year: 2009
• Where: ISAAC
• Authors: Deepanjan Kesh, Shashank K. Mehta
• Keywords: Algorithms, Integer Matrix, Integer Programs, ISAAC 2009, Toric Ideal