The remarkable fact is: The number of base cases is logarithmic in the number of constraints. This yields an O(m + log m s^2) algorithm for ILP in fixed dimension, where each of the m constraints has binary encoding length at most s.
View Document Edit History