Computing the Ehrhart polynomial of a convex lattice polytope

Abstract

We prove that computation of any fixed number of highest coefficients of the Ehrhart polynomial of an integral polytope can be reduced in polynomial time to computation of the volumes of faces. © 1994 Springer-Verlag New York Inc.