Fooling polytopes
From MaRDI portal
Publication:5212803
DOI10.1145/3313276.3316321zbMath1433.68605arXiv1808.04035OpenAlexW2967736421MaRDI QIDQ5212803
Ryan O'Donnell, Li-Yang Tan, Rocco A. Servedio
Publication date: 30 January 2020
Published in: Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1808.04035
Analysis of algorithms (68W40) Integer programming (90C10) Computational aspects related to convexity (52B55) Approximation algorithms (68W25) Randomized algorithms (68W20)
Related Items
Fooling Polytopes, Nearly optimal central limit theorem and bootstrap approximations in high dimensions, Second- and higher-order Gaussian anticoncentration inequalities and error bounds in Slepian's comparison theorem, Algorithms and lower bounds for de morgan formulas of low-communication leaf gates, Central limit theorem and bootstrap approximation in high dimensions: near \(1/\sqrt{n}\) rates via implicit smoothing, Improved central limit theorem and bootstrap approximations in high dimensions