论文信息 - Computing the volume, counting integral points, and exponential sums

Computing the volume, counting integral points, and exponential sums

We design polynomial-time algorithms for some particular cases of the volume computation problem and the integral points counting problem for convex polytopes. The basic idea is a reduction to the computation of certain exponential sums and integrals. We give elementary proofs of some known identities between these sums and integrals and prove some new identities.

Alexander I. Barvinok

[1] L. Khachiyan. COMMUNICATIONS OF THE MOSCOW MATHEMATICAL SOCIETY: The problem of calculating the volume of a polyhedron is enumerably hard , 1989 .

[2] A. N. Varchenko,et al. Combinatorics and topology of the disposition of affine hyperplanes in real space , 1987 .

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

[4] Ravi Kannan,et al. Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix , 1979, SIAM J. Comput..

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

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

[7] I. Gel'fand,et al. Heaviside functions of a configuration of hyperplanes , 1987 .

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

[9] I. G. MacDonald,et al. Symmetric functions and Hall polynomials , 1979 .

[10] M. Brion. Points entiers dans les polyèdres convexes , 1988 .

[11] Martin E. Dyer,et al. A random polynomial-time algorithm for approximating the volume of convex bodies , 1991, JACM.