A geometric inequality and the complexity of computing volume

Cites Work

Title not available (Why is that?)
Title not available (Why is that?)

Cited In (40)

Deterministic and randomized polynomial‐time approximation of radii
The curse of dimensionality for the class of monotone functions and for the class of convex functions
An FPTAS for Computing the Distribution Function of the Longest Path Length in DAGs with Uniformly Distributed Edge Lengths
On The Complexity of Computing Mixed Volumes
Some Results on the Complexity of Numerical Integration
On optimal disc covers and a new characterization of the Steiner center
A practical algorithm for volume estimation based on billiard trajectories and simulated annealing
Similarity of personal preferences: Theoretical foundations and empirical analysis
Probabilistic Lipschitz analysis of neural networks
The curse of dimensionality for numerical integration on general domains
The curse of dimensionality for numerical integration of smooth functions. II
Concentration phenomena in high dimensional geometry
An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution
Some more n‐dimensional geometry†
Blessing of dimensionality at the edge and geometry of few-shot learning
Approximating the volume of convex bodies
Title not available (Why is that?)
Uniform generation in spatial constraint databases and applications
Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
On the problem of approximating the number of bases of a matroid
(Deterministic) algorithms that compute the volume of polytopes
Near-optimal deterministic algorithms for volume computation via M-ellipsoids
On the shape of the convex hull of random points
Testing distributional assumptions of learning algorithms
An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
Approximating the volume of tropical polytopes is difficult
How to integrate a polynomial over a simplex
Large deviations, moderate deviations, and the KLS conjecture
Title not available (Why is that?)
Practical Volume Estimation of Zonotopes by a New Annealing Schedule for Cooling Convex Bodies
Exploiting sparsity for semi-algebraic set volume computation
Ehrhart polynomials of matroid polytopes and polymatroids
Heat flow and a faster algorithm to compute the surface area of a convex body
On the complexity of some basic problems in computational convexity. I. Containment problems
Title not available (Why is that?)
Volumes Spanned by Random Points in the Hypercube
Dispersion of mass and the complexity of randomized geometric algorithms
MCMC convergence diagnosis via multivariate bounds on log-concave densities
Practical volume approximation of high-dimensional convex bodies, applied to modeling portfolio dependencies and financial crises
Computing the volume is difficult

   Recommendations

Computing the volume is difficult 👍 👎
Approximating the volume of convex bodies 👍 👎
Polytope Volume Computation 👍 👎
Title not available (Why is that?) 👍 👎
Title not available (Why is that?) 👍 👎

This page was built for publication: A geometric inequality and the complexity of computing volume

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1087143)