86
Voted
SODA
2004
ACM
15 years 4 months ago
2004
ACM
We show that the point containment problem in the integer hull of a polyhedron, which is defined by m inequalities, with coefficients of at most bits can be solved in time O(m + ...