A Simple Algorithm for Counting Solutions to Integer Programs

Daniel Dadush, Anita Dürr, Thekla Hamm +2

We consider the problem of counting solutions to integer linear programming problems of the form $\{x\in {\mathbb{Z}}_{\ge 0}^n:Ax=b\}$ where $A \in \{-Δ,\ldots,Δ\}^{m \times n…