A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
Alexander I. Barvinok · Mathematics of Operations Research · 1994
We prove that for any dimension d there exists a polynomial time algorithm for counting integral points in polyhedra in the d-dimensional Euclidean space. Previously such algorithms were known for dimensions d = 1, 2, 3, and 4 only.