Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families
From MaRDI portal
Publication:5417737
zbMath1288.90062arXiv0904.0583MaRDI QIDQ5417737
Daniel Dadush, Karthekeyan Chandrasekaran, Santosh Vempala
Publication date: 22 May 2014
Full work available at URL: https://arxiv.org/abs/0904.0583
Convex programming (90C25) Nonnumerical algorithms (68W05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (6)
Radial duality. II: Applications and algorithms ⋮ Starshaped sets ⋮ Approximating the volume of unions and intersections of high-dimensional geometric objects ⋮ Unnamed Item ⋮ On Sampling from Multivariate Distributions ⋮ Isoperimetric enclosures
This page was built for publication: Thin Partitions: Isoperimetric Inequalities and Sampling Algorithms for some Nonconvex Families
