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.

Saved in:
Bibliographic Details
Published inSIAM journal on computing Vol. 17; no. 5; pp. 967 - 974
Main Authors Dyer, M. E., Frieze, A. M.
Format Journal Article
LanguageEnglish
Published Philadelphia Society for Industrial and Applied Mathematics 01.10.1988
Subjects
Approximation
Polyhedra
Polytopes
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:0097-5397
1095-7111
DOI:10.1137/0217060