Pages that link to "Item:Q3976408"
From MaRDI portal
The following pages link to Computing the volume of convex bodies: A case where randomness provably helps (Q3976408):
Displaying 41 items.
- Sharp \(L^1\)-Poincaré inequalities correspond to optimal hypersurface cuts (Q494597) (← links)
- A polynomial number of random points does not determine the volume of a convex body (Q542396) (← links)
- Poincaré inequality in mean value for Gaussian polytopes (Q664340) (← links)
- Nash inequalities for finite Markov chains (Q678089) (← links)
- Dispersion of mass and the complexity of randomized geometric algorithms (Q947778) (← links)
- Counting linear extensions (Q1183942) (← links)
- The Shapley value for cooperative games under precedence constraints (Q1202565) (← links)
- Balanced pairs in partial orders (Q1301727) (← links)
- Faster random generation of linear extensions (Q1301730) (← links)
- Random walks, totally unimodular matrices, and a randomised dual simplex algorithm (Q1330890) (← links)
- How to compute the volume in high dimension? (Q1403293) (← links)
- Mixing times of lozenge tiling and card shuffling Markov chains (Q1431558) (← links)
- Polynomial-time counting and sampling of two-rowed contingency tables (Q1583095) (← links)
- Normalizing constants of log-concave densities (Q1746544) (← links)
- A slowly mixing Markov chain with implications for Gibbs sampling (Q1801885) (← links)
- A random polynomial time algorithm for well-routing convex bodies (Q1805452) (← links)
- Largest \(j\)-simplices in \(n\)-polytopes (Q1892425) (← links)
- Isoperimetric problems for convex bodies and a localization lemma (Q1892428) (← links)
- Multivariate volume, Ehrhart, and \(h^\ast \)-polynomials of polytropes (Q2156367) (← links)
- Approximating the Hausdorff distance by \(\alpha\)-dense curves (Q2236584) (← links)
- Approximation algorithms for the normalizing constant of Gibbs distributions (Q2341636) (← links)
- Approximating the volume of convex bodies (Q2368127) (← links)
- On the diffusion geometry of graph Laplacians and applications (Q2415409) (← links)
- A sharp isoperimetric bound for convex bodies (Q2480559) (← links)
- Simulated annealing in convex bodies and an \(O^{*}(n^{4}\)) volume algorithm (Q2490265) (← links)
- Computational complexity of stochastic programming problems (Q2492669) (← links)
- Approximation of convex sets by polytopes (Q2519248) (← links)
- Likelihood-based inference for Matérn type-III repulsive point processes (Q3558933) (← links)
- (Q3832046) (← links)
- Random walks in a convex body and an improved volume algorithm (Q4284999) (← links)
- A random polynomial-time algorithm for approximating the volume of convex bodies (Q4302827) (← links)
- Gaussian Cooling and $O^*(n^3)$ Algorithms for Volume and Gaussian Volume (Q4571932) (← links)
- (Q5053269) (← links)
- Isoperimetric inequalities in unbounded convex bodies (Q5063342) (← links)
- Geodesic Walks in Polytopes (Q5073522) (← links)
- Isoperimetric inequalities in Euclidean convex bodies (Q5247025) (← links)
- Fixed Precision MCMC Estimation by Median of Products of Averages (Q5321751) (← links)
- Random Construction of Interpolating Sets for High-Dimensional Integration (Q5416543) (← links)
- Geometric and functional inequalities for log-concave probability sequences (Q6151028) (← links)
- An algorithm for estimating non-convex volumes and other integrals in \(n\) dimensions (Q6172887) (← links)
- No dimension-free deterministic algorithm computes approximate stationarities of Lipschitzians (Q6634520) (← links)
