# Approximating the Volume of Tropical Polytopes is Difficult

## TL;DR

This paper proves that approximating the volume and counting integer points in tropical polytopes is computationally very hard, with no efficient approximation algorithms unless P=NP, surpassing classical polytope complexity.

## Contribution

It establishes the computational hardness of volume approximation and integer point counting in tropical polytopes, extending classical polytope complexity results to the tropical setting.

## Key findings

- No polynomial-factor approximation algorithm for tropical polytope volume unless P=NP.
- Counting integer points in tropical polytopes is -hard.
- Volume and counting problems are -hard for tropical polytopes described by inequalities.

## 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 $\alpha=2^{\text{poly}(m,n)}$ for the volume of a tropical polytope given by $n$ vertices in a space of dimension $m$, unless P$=$NP. 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.