Complexity of Polytope Volume Computation

Publisher Website

1 January 1993

book chapter
Published by Springer Nature

p. 91-101
https://doi.org/10.1007/978-3-642-58043-7_5

Abstract

No abstract available

Keywords

This publication has 6 references indexed in Scilit:

Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation, 1989
Geometric Algorithms and Combinatorial Optimization
Published by Springer Nature ,1988
A geometric inequality and the complexity of computing volume
Discrete & Computational Geometry, 1986
Hard Enumeration Problems in Geometry and Combinatorics
SIAM Journal on Algebraic Discrete Methods, 1986
Two poset polytopes
Discrete & Computational Geometry, 1986
How good is the information theory bound in sorting?
Theoretical Computer Science, 1976