Talk page

Title:
A quick estimate for the volume of a polyhedron

Speaker:
Alexander Barvinok

Abstract:
Abstract: Let P be a bounded polyhedron defined as the intersectionof the non-negative orthant in R^n and an affine subspace of codimension m. I present a simple and computationally efficient formula that approximates the volume of P within a factor of c^m, where c > 0 is an absolute constant. I also plan to discuss ramifications, based on the maximum entropy approach, for counting

Link:
http://scgp.stonybrook.edu/video_portal/video.php?id=5788

Workshop:
Simons- Workshop: Combinatorics and Geometry of Convex Polyhedra