A simple proof that integer programming ts in X~ ~s given. The proof also estabhshes that there ~s a pseudopolynomial-tune algorithm for integer programmmg with any (fixed) number of constraints.
No takes yet. Share an insight, caveat, or question.
Christos H. Papadimitriou (1981) studied this question.
Synapse has enriched one closely related paper. Consider it for comparative context: