论文信息 - Computing the Ehrhart polynomial of a convex lattice polytope - 字舞流文

Computing the Ehrhart polynomial of a convex lattice polytope

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.

A. I. Barvinok | A. Barvinok

[1] R. Stanley. What Is Enumerative Combinatorics , 1986 .

[2] Martin E. Dyer,et al. On the Complexity of Computing the Volume of a Polyhedron , 1988, SIAM J. Comput..

[3] W. Fulton. Introduction to Toric Varieties. , 1993 .

[4] William J. Cook,et al. On integer points in polyhedra , 1992, Comb..

[5] Alexander I. Barvinok,et al. A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[6] L. Lovász,et al. Geometric Algorithms and Combinatorial Optimization , 1981 .

[7] James Pommersheim,et al. Toric varieties, lattice points and Dedekind sums , 1993 .

[8] I. G. MacDonald,et al. Polynomials Associated with Finite Gell-Complexes , 1971 .

[9] R. Morelli,et al. Pick's theorem and the Todd class of a toric variety , 1993 .

[10] Ravi Kannan,et al. Minkowski's Convex Body Theorem and Integer Programming , 1987, Math. Oper. Res..

[11] J. Lawrence. Polytope volume computation , 1991 .

[12] William Fulton,et al. Introduction to Toric Varieties. (AM-131) , 1993 .