Computing the volume, counting integral points, and exponential sums
- 1 July 1993
- journal article
- Published by Springer Science and Business Media LLC in Discrete & Computational Geometry
- Vol. 10 (2), 123-141
- https://doi.org/10.1007/bf02573970
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Polytope volume computationMathematics of Computation, 1991
- A random polynomial-time algorithm for approximating the volume of convex bodiesJournal of the ACM, 1991
- On the Complexity of Computing the Volume of a PolyhedronSIAM Journal on Computing, 1988
- Geometric Algorithms and Combinatorial OptimizationAlgorithms and Combinatorics, 1988
- Points entiers dans les polyèdres convexesAnnales Scientifiques de lʼÉcole Normale Supérieure, 1988
- Computing the volume is difficultDiscrete & Computational Geometry, 1987
- Combinatorics and topology of the disposition of affine hyperplanes in real spaceFunctional Analysis and Its Applications, 1987
- Enumerative CombinatoricsPublished by Springer Science and Business Media LLC ,1986
- Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer MatrixSIAM Journal on Computing, 1979