An invariance principle for polytopes

DOI10.1145/1806689.1806764zbMath1293.68224MaRDI QIDQ2875181

Prahladh Harsha, Raghu Meka, Adam R. Klivans

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806764

zbMATH Keywords

polytopes; invariance principles; noise sensitivity; limit theorems; pseudorandom generators; agnostic learning; contingency tables; average sensitivity

Mathematics Subject Classification ID

60F05: Central limit and other weak theorems

52B55: Computational aspects related to convexity

68T05: Learning and adaptive systems in artificial intelligence

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

65C10: Random number generation in numerical analysis

62H17: Contingency tables

Related Items

Pseudorandom generators for combinatorial checkerboards