A geometric inequality and the complexity of computing volume
From MaRDI portal
Redirect page
Recommendations
Cited in
(45)- Deterministic and randomized polynomial‐time approximation of radii
- Toward derandomizing Markov chain Monte Carlo
- 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
- On optimal disc covers and a new characterization of the Steiner center
- Similarity of personal preferences: Theoretical foundations and empirical analysis
- The curse of dimensionality for numerical integration on general domains
- Probabilistic Lipschitz analysis of neural networks
- A practical algorithm for volume estimation based on billiard trajectories and simulated annealing
- The curse of dimensionality for numerical integration of smooth functions. II
- Practical volume estimation of zonotopes by a new annealing schedule for cooling convex bodies
- Concentration phenomena in high dimensional geometry
- Maximum inscribed and minimum enclosing tropical balls of tropical polytopes and applications to volume estimation and uniform sampling
- 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
- Deterministically approximating the volume of a Kostka polytope
- scientific article; zbMATH DE number 7236423 (Why is no real title available?)
- 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
- On the shape of the convex hull of random points
- Near-optimal deterministic algorithms for volume computation via M-ellipsoids
- An FPTAS for the volume of some \(\mathcal{V} \)-polytopes -- it is hard to compute the volume of the intersection of two cross-polytopes
- Reducing isotropy and volume to KLS: faster rounding and volume algorithms
- How to integrate a polynomial over a simplex
- Testing distributional assumptions of learning algorithms
- Large deviations, moderate deviations, and the KLS conjecture
- Approximating the volume of tropical polytopes is difficult
- scientific article; zbMATH DE number 5990521 (Why is no real title available?)
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Exploiting sparsity for semi-algebraic set volume computation
- Ehrhart polynomials of matroid polytopes and polymatroids
- Some results on the complexity of numerical integration
- On the complexity of some basic problems in computational convexity. I. Containment problems
- Volumes Spanned by Random Points in the Hypercube
- Heat flow and a faster algorithm to compute the surface area of a convex body
- Dispersion of mass and the complexity of randomized geometric algorithms
- scientific article; zbMATH DE number 4108152 (Why is no real title available?)
- 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
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)
