2 research outputs found
A Faster Algorithm for Two-Variable Integer Programming
We show that a 2-variable integer program, defined by constraints involving coefficients with at most bits can be solved with arithmetic operations on rational numbers of size~. This result closes the gap between the running time of two-variable integer programming with the sum of the running times of the Euclidean algorithm on -bit integers and the problem of checking feasibility of an integer point for ~constraints