Publisher
Springer International Publishing
Reference17 articles.
1. Lecture Notes in Computer Science;E Ando,2017
2. Ando, E., Kijima, S.: An FPTAS for the volume of a
$${\cal{V}}$$
-polytopes—it is hard to compute the volume of the intersection of two cross-polytopes.
arXiv:1607.06173
3. Ando, E., Kijima, S.: An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution. Algorithmica 76(4), 1245–1263 (2016)
4. Lecture Notes in Computer Science;E Ando,2017
5. Bárány, I., Füredi, Z.: Computing the volume is difficult. Discrete Comput. Geom. 2, 319–326 (1987)