A quick estimate for the volume of a polyhedron
From MaRDI portal
Publication:6635461
DOI10.1007/S11856-024-2615-ZMaRDI QIDQ6635461FDOQ6635461
Authors: Alexander Barvinok, Mark Rudelson 
Publication date: 12 November 2024
Published in: Israel Journal of Mathematics (Search for Journal in Brave)
Recommendations
Length, area, volume and convex sets (aspects of convex geometry) (52A38) Polyhedra and polytopes; regular figures, division of spaces (51M20) Length, area and volume in real or complex geometry (51M25)
Cites Work
- Title not available (Why is that?)
- On the vertices of the \(d\)-dimensional Birkhoff polytope
- The asymptotic volume of the Birkhoff polytope
- Geometric algorithms and combinatorial optimization
- Title not available (Why is that?)
- Asymptotic geometric analysis. I
- Geometry of isotropic convex bodies
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Approximation of zonoids by zonotopes
- Combinatorics and geometry of transportation polytopes: an update
- Title not available (Why is that?)
- Gelfand numbers of operators with values in a Hilbert space
- EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES
- Approximation of the Sphere by Polytopes having Few Vertices
- A central limit theorem for convex sets
- An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture
- Polytope Volume Computation
- On the Complexity of Computing the Volume of a Polyhedron
- Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
- Convex geometry and functional analysis
- Faster deterministic volume estimation in the oracle model via thin lattice coverings
- Title not available (Why is that?)
- Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
- The geometry of logconcave functions and sampling algorithms
- Partitions of mass-distributions and of convex bodies by hyperplanes
- Computing the volume is difficult
- An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
- Near-optimal deterministic algorithms for volume computation via M-ellipsoids
- Title not available (Why is that?)
- Asymptotic geometric analysis. Part II
- Bourgain's slicing problem and KLS isoperimetry up to polylog
- The Kannan-Lovász-Simonovits conjecture
- Phase transition in random contingency tables with non-uniform margins
- Lower bounds for contingency tables via Lorentzian polynomials
This page was built for publication: A quick estimate for the volume of a polyhedron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635461)
