scientific article; zbMATH DE number 18983
From MaRDI portal
Publication:3976408
Recommendations
- A random polynomial-time algorithm for approximating the volume of convex bodies
- How to compute the volume in high dimension?
- A polynomial number of random points does not determine the volume of a convex body
- Random walks in a convex body and an improved volume algorithm
- scientific article; zbMATH DE number 65730
Cited in
(47)- Counting linear extensions
- The Shapley value for cooperative games under precedence constraints
- Balanced pairs in partial orders
- Faster random generation of linear extensions
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm
- How to compute the volume in high dimension?
- Mixing times of lozenge tiling and card shuffling Markov chains
- Polynomial-time counting and sampling of two-rowed contingency tables
- Normalizing constants of log-concave densities
- A slowly mixing Markov chain with implications for Gibbs sampling
- A random polynomial time algorithm for well-routing convex bodies
- Largest \(j\)-simplices in \(n\)-polytopes
- Isoperimetric problems for convex bodies and a localization lemma
- Multivariate volume, Ehrhart, and \(h^\ast \)-polynomials of polytropes
- Approximating the Hausdorff distance by \(\alpha\)-dense curves
- Approximation algorithms for the normalizing constant of Gibbs distributions
- Approximating the volume of convex bodies
- On the diffusion geometry of graph Laplacians and applications
- A sharp isoperimetric bound for convex bodies
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm
- Computational complexity of stochastic programming problems
- Approximation of convex sets by polytopes
- scientific article; zbMATH DE number 431987 (Why is no real title available?)
- Likelihood-based inference for Matérn type-III repulsive point processes
- Decoupling and Partial Independence
- scientific article; zbMATH DE number 4108152 (Why is no real title available?)
- Random walks in a convex body and an improved volume algorithm
- A random polynomial-time algorithm for approximating the volume of convex bodies
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume
- Sharp \(L^1\)-Poincaré inequalities correspond to optimal hypersurface cuts
- scientific article; zbMATH DE number 7626762 (Why is no real title available?)
- Isoperimetric inequalities in unbounded convex bodies
- Geodesic Walks in Polytopes
- Near-optimal deterministic algorithms for volume computation via M-ellipsoids
- Isoperimetric inequalities in Euclidean convex bodies
- Fixed Precision MCMC Estimation by Median of Products of Averages
- Random Construction of Interpolating Sets for High-Dimensional Integration
- A polynomial number of random points does not determine the volume of a convex body
- Geometric and functional inequalities for log-concave probability sequences
- An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions
- No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians
- Poincaré inequality in mean value for Gaussian polytopes
- Nash inequalities for finite Markov chains
- Deterministically approximating the volume of a Kostka polytope
- Sampling from convex sets with a cold start using multiscale decompositions
- Reducing isotropy and volume to KLS: faster rounding and volume algorithms
- Dispersion of mass and the complexity of randomized geometric algorithms
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3976408)
