scientific article; zbMATH DE number 4108152
From MaRDI portal
Publication:3832046
Recommendations
- On the Complexity of Computing the Volume of a Polyhedron
- scientific article; zbMATH DE number 4201621
- The problem of calculating the volume of a polyhedron is enumerably hard
- scientific article; zbMATH DE number 431987
- A geometric inequality and the complexity of computing volume
- (Deterministic) algorithms that compute the volume of polytopes
- Computing Volumes of Polyhedra
- scientific article; zbMATH DE number 18983
- On the volume conjecture for polyhedra
Cited in
(13)- Computing the Ehrhart polynomial of a convex lattice polytope
- Computing mixed volume and all mixed cells in quermassintegral time
- Counting polygon triangulations is hard
- An FPTAS for the volume of some \(\mathcal{V}\)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
- Polytope Volume Computation
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes
- Approximating the centroid is hard
- Complexity of approximating the vertex centroid of a polyhedron
- Hard Enumeration Problems in Geometry and Combinatorics
- On the Complexity of Computing the Volume of a Polyhedron
- Computing the volume, counting integral points, and exponential sums
- Complexity of approximating the vertex centroid of a polyhedron
- On the hardness of computing intersection, union and Minkowski sum of polytopes
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3832046)
