A quick estimate for the volume of a polyhedron
From MaRDI portal
Publication:6635461
DOI10.1007/s11856-024-2615-zMaRDI QIDQ6635461
M. V. Rudel'son, Alexander I. Barvinok
Publication date: 12 November 2024
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Polyhedra and polytopes; regular figures, division of spaces (51M20) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Length, area and volume in real or complex geometry (51M25)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Partitions of mass-distributions and of convex bodies by hyperplanes
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
- Computing the volume is difficult
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Gelfand numbers of operators with values in a Hilbert space
- Geometric algorithms and combinatorial optimization
- Approximation of zonoids by zonotopes
- An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture
- Bourgain's slicing problem and KLS isoperimetry up to polylog
- On the vertices of the \(d\)-dimensional Birkhoff polytope
- A central limit theorem for convex sets
- Lower bounds for contingency tables via Lorentzian polynomials
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- Polytope Volume Computation
- Asymptotic Geometric Analysis, Part II
- The geometry of logconcave functions and sampling algorithms
- Combinatorics and Geometry of Transportation Polytopes: An Update
- The asymptotic volume of the Birkhoff polytope
- Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
- EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES
- On the Complexity of Computing the Volume of a Polyhedron
- Approximation of the Sphere by Polytopes having Few Vertices
- Phase transition in random contingency tables with non-uniform margins
- Near-optimal deterministic algorithms for volume computation via M-ellipsoids
- The Kannan–Lovász–Simonovits conjecture
- Asymptotic Geometric Analysis, Part I
- Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings
This page was built for publication: A quick estimate for the volume of a polyhedron