On the Complexity of Computing the Volume of a Polyhedron
- 1 October 1988
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 17 (5), 967-974
- https://doi.org/10.1137/0217060
Abstract
No abstract availableThis publication has 3 references indexed in Scilit:
- A geometric inequality and the complexity of computing volumeDiscrete & Computational Geometry, 1986
- An Algorithmic Theory of Numbers, Graphs and ConvexityPublished by Society for Industrial & Applied Mathematics (SIAM) ,1986
- The Complexity of Enumeration and Reliability ProblemsSIAM Journal on Computing, 1979