On the Complexity of Computing the Volume of a Polyhedron

We show that computing the volume of a polyhedron given either as a list of facets or as a list of vertices is as hard as computing the permanent of a matrix.