Article ID: | iaor2004733 |
Country: | United States |
Volume: | 22 |
Issue: | 3 |
Start Page Number: | 545 |
End Page Number: | 549 |
Publication Date: | Aug 1997 |
Journal: | Mathematics of Operations Research |
Authors: | Kannan R., Dyer M. |
Keywords: | sets |
We describe a simplification of a recent polynomial-time algorithm of A.I. Barvinok for counting the number of lattice points in a polyhedron in fixed dimension. In particular, we show that only very elementary properties of exponential sums are needed to develop a polynomial-time algorithm.