On the Algebraic Complexity of Certain Integer Linear Programming Problems