Approximating the Volume of Tropical Polytopes is Difficult
arXiv:1706.06467 · doi:10.1142/S0218196719500061
Abstract
We investigate the complexity of counting the number of integer points in tropical polytopes, and the complexity of calculating their volume. We study the tropical analogue of the outer parallel body and establish bounds for its volume. We deduce that there is no approximation algorithm of factor for the volume of a tropical polytope given by vertices in a space of dimension , unless PNP. Neither is there such an approximation algorithm for counting the number of integer points in tropical polytopes described by vertices. If follows that approximating these values for tropical polytopes is more difficult than for classical polytopes. Our proofs use a reduction from the problem of calculating the tropical rank. For tropical polytopes described by inequalities we prove that counting the number of integer points and calculating the volume are P-hard.
References in corpus (12)
- Duality and separation theorems in idempotent semimodules
- Tropical polyhedra are equivalent to mean payoff games
- Max-plus (A,B)-invariant spaces and control of timed discrete event systems
- Log-barrier interior point methods are not strongly polynomial
- Tropicalizing the simplex algorithm
- The max-plus Martin boundary
- Max-plus definite matrix closures and their eigenspaces
- Factorization of polynomials in one variable over the tropical semiring
- Tropical Fourier-Motzkin elimination, with an application to real-time verification
- Minimal external representations of tropical polyhedra
- Long and winding central paths
- A tropical isoperimetric inequality