scientific article; zbMATH DE number 4108152
From MaRDI portal
Publication:3832046
zbMATH Open0676.68016MaRDI QIDQ3832046FDOQ3832046
Authors: Leonid G. Khachiyan 
Publication date: 1989
Title of this publication is not available (Why is that?)
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
Computing methodologies and applications (68U99) Analysis of algorithms and problem complexity (68Q25) Polytopes and polyhedra (52Bxx)
Cited In (13)
- On the Complexity of Computing the Volume of a Polyhedron
- Hard Enumeration Problems in Geometry and Combinatorics
- An FPTAS for the volume of some \(\mathcal{V}\)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
- Computing the volume, counting integral points, and exponential sums
- Approximating the centroid is hard
- On the hardness of computing intersection, union and Minkowski sum of polytopes
- Computing mixed volume and all mixed cells in quermassintegral time
- Complexity of approximating the vertex centroid of a polyhedron
- Counting polygon triangulations is hard
- Complexity of approximating the vertex centroid of a polyhedron
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes
- Computing the Ehrhart polynomial of a convex lattice polytope
- Polytope Volume Computation
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)
