Publication:3362174

zbMath0753.65018MaRDI QIDQ3362174

Alexander I. Barvinok

Publication date: 1991

Full work available at URL: https://eudml.org/doc/68184

zbMATH Keywords

volume; computational complexity; polytope; exponential integrals; polynomial- time algorithms

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

52B55: Computational aspects related to convexity

65D32: Numerical quadrature and cubature formulas

65Y20: Complexity and performance of numerical algorithms

Related Items

Computing the volume, counting integral points, and exponential sums