Sciweavers

Share
ISAAC
2009
Springer

Generalized Reduction to Compute Toric Ideals

10 years 4 days ago
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.
Deepanjan Kesh, Shashank K. Mehta
Added 26 May 2010
Updated 26 May 2010
Type Conference
Year 2009
Where ISAAC
Authors Deepanjan Kesh, Shashank K. Mehta
Comments (0)
books