A quick estimate for the volume of a polyhedron

DOI10.1007/S11856-024-2615-ZMaRDI QIDQ6635461zbMATH OpenFDO

Authors Alexander Barvinok, Mark Rudelson

Publication date 12 November 2024

Published in Israel Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

polyhedronvolume of a polyhedronentropy density

Mathematics Subject Classification ID

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)

Recommendations

• Polytope Volume Computation
• Approximating the volume of convex bodies
• Practical polytope volume approximation
• On the Complexity of Computing the Volume of a Polyhedron
• scientific article; zbMATH DE number 431987

Cites work

• scientific article; zbMATH DE number 4103721 (Why is no real title available?)
• scientific article; zbMATH DE number 194093 (Why is no real title available?)
• scientific article; zbMATH DE number 516159 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 5019925 (Why is no real title available?)
• A central limit theorem for convex sets
• A polynomial-time algorithm, based on Newton's method, for linear programming
• An almost constant lower bound of the isoperimetric coefficient in the KLS conjecture
• An asymptotic formula for the number of non-negative integer matrices with prescribed row and column sums
• Approximation of the Sphere by Polytopes having Few Vertices
• Approximation of zonoids by zonotopes
• Asymptotic Estimates for the Number of Contingency Tables, Integer Flows, and Volumes of Transportation Polytopes
• Asymptotic geometric analysis. I
• Asymptotic geometric analysis. Part II
• Bourgain's slicing problem and KLS isoperimetry up to polylog
• Combinatorics and geometry of transportation polytopes: an update
• Computing the volume is difficult
• Convex geometry and functional analysis
• EXTREMAL PROPERTIES OF ORTHOGONAL PARALLELEPIPEDS AND THEIR APPLICATIONS TO THE GEOMETRY OF BANACH SPACES
• Faster deterministic volume estimation in the oracle model via thin lattice coverings
• Gelfand numbers of operators with values in a Hilbert space
• Geometric algorithms and combinatorial optimization
• Geometry of isotropic convex bodies
• Lower bounds for contingency tables via Lorentzian polynomials
• Maximum entropy Gaussian approximations for the number of integer points and volumes of polytopes
• Near-optimal deterministic algorithms for volume computation via M-ellipsoids
• On the Complexity of Computing the Volume of a Polyhedron
• On the vertices of the \(d\)-dimensional Birkhoff polytope
• Partitions of mass-distributions and of convex bodies by hyperplanes
• Phase transition in random contingency tables with non-uniform margins
• Polytope Volume Computation
• The Kannan-Lovász-Simonovits conjecture
• The asymptotic volume of the Birkhoff polytope
• The geometry of logconcave functions and sampling algorithms

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)