{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:47:16Z","timestamp":1764557236036,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,5]],"date-time":"2010-06-05T00:00:00Z","timestamp":1275696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,5]]},"DOI":"10.1145\/1806689.1806764","type":"proceedings-article","created":{"date-parts":[[2010,6,8]],"date-time":"2010-06-08T12:37:34Z","timestamp":1276000654000},"page":"543-552","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["An invariance principle for polytopes"],"prefix":"10.1145","author":[{"given":"Prahladh","family":"Harsha","sequence":"first","affiliation":[{"name":"Tata Institute of Fundamanetal Researach, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Klivans","sequence":"additional","affiliation":[{"name":"University of Texas, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Raghu","family":"Meka","sequence":"additional","affiliation":[{"name":"University of Texas, Austin, TX, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,5]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1145\/1132516.1132597"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/BF00970805"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1016\/S0378-3758(02)00094-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1007\/BF02698830"},{"key":"e_1_3_2_1_5_1","volume-title":"http:\/\/math.sfsu.edu\/beck\/ccd.html Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra. Undergraduate Texts in Mathematics","author":"Beck Matthias","year":"2007","unstructured":"Matthias Beck and Sinai Robins . http:\/\/math.sfsu.edu\/beck\/ccd.html Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra. Undergraduate Texts in Mathematics . Springer , 1 st edition, 2007 . Matthias Beck and Sinai Robins. http:\/\/math.sfsu.edu\/beck\/ccd.html Computing the Continuous Discretely: Integer-point Enumeration in Polyhedra. Undergraduate Texts in Mathematics. Springer, 1st edition, 2007.","edition":"1"},{"key":"e_1_3_2_1_6_1","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1090\/conm\/453\/08798","volume-title":"Surveys on Discrete and Computational Geometry: Twenty Years Later","author":"Barvinok Alexander","year":"2008","unstructured":"Alexander Barvinok and Ellen Veomett . http:\/\/www.ams.org\/bookstore-getitem\/item=CONM-453 The computational complexity of convex bodies . In Jacob E. Goodman, J\u00e1nos Pach, and Richard Pollack, eds., Surveys on Discrete and Computational Geometry: Twenty Years Later , volume 453 of Contemporary Mathematics , pages 117 -- 137 . AMS , 2008 . http:\/\/arxiv.org\/abs\/math\/0610325\/arXiv:math\/0610325. Alexander Barvinok and Ellen Veomett. http:\/\/www.ams.org\/bookstore-getitem\/item=CONM-453 The computational complexity of convex bodies. In Jacob E. Goodman, J\u00e1nos Pach, and Richard Pollack, eds., Surveys on Discrete and Computational Geometry: Twenty Years Later, volume 453 of Contemporary Mathematics, pages 117--137. AMS, 2008. http:\/\/arxiv.org\/abs\/math\/0610325\/arXiv:math\/0610325."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1016\/S0022-0000(03)00014-X"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1145\/1806689.1806763"},{"key":"e_1_3_2_1_9_1","volume-title":"Bounded independence fools degree-2 threshold functions","author":"Diakonikolas Ilias","year":"2009","unstructured":"Ilias Diakonikolas , Daniel M. Kane , and Jelani Nelson . Bounded independence fools degree-2 threshold functions , 2009 . http:\/\/arxiv.org\/abs\/0911.3389\/arXiv:0911.3389. Ilias Diakonikolas, Daniel M. Kane, and Jelani Nelson. Bounded independence fools degree-2 threshold functions, 2009. http:\/\/arxiv.org\/abs\/0911.3389\/arXiv:0911.3389."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/780542.780643"},{"key":"e_1_3_2_1_11_1","volume-title":"An Introduction to Probability Theory and Its Applications","author":"Feller William","year":"1971","unstructured":"William Feller . An Introduction to Probability Theory and Its Applications , Volume 2 . Wiley , 2 nd edition, 1971 . William Feller. An Introduction to Probability Theory and Its Applications, Volume 2. Wiley, 2nd edition, 1971.","edition":"2"},{"key":"e_1_3_2_1_12_1","volume-title":"CCC, to appear.","author":"Gopalan P.","year":"2010","unstructured":"P. Gopalan , R. O'Donnell , Y. Wu , and D. Zuckerman . Fooling functions of halfspaces under product distributions . In CCC, to appear. 2010 . P. Gopalan, R. O'Donnell, Y. Wu, and D. Zuckerman. Fooling functions of halfspaces under product distributions. In CCC, to appear. 2010."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/227683.227684"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/502090.502098"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/195058.195190"},{"key":"e_1_3_2_1_16_1","volume-title":"Approximation Algorithms for NP-hard Problems","author":"Jerrum Mark","year":"1997","unstructured":"Mark Jerrum and Alistair Sinclair . http:\/\/www.ieor.berkeley.edu\/ hochbaum\/html\/book-aanp.html The Markov chain Monte Carlo method: An approach to approximate counting and integration . In Dorit S. Hochbaum, ed., Approximation Algorithms for NP-hard Problems . PWS Publishing Company , 1997 . Mark Jerrum and Alistair Sinclair. http:\/\/www.ieor.berkeley.edu\/ hochbaum\/html\/book-aanp.html The Markov chain Monte Carlo method: An approach to approximate counting and integration. In Dorit S. Hochbaum, ed., Approximation Algorithms for NP-hard Problems. PWS Publishing Company, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/SFCS.1988.21923"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1137\/S0097539705447372"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1137\/060649057"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1016\/j.jcss.2003.11.002"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1109\/FOCS.2008.64"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/174130.174138"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1007\/978-1-4615-2696-4_11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1137\/S0097539796309326"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1109\/SFCS.2005.53"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1109\/FOCS.2008.44"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1145\/1806689.1806749"},{"key":"e_1_3_2_1_29_1","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/978-3-540-36428-3_15","volume-title":"Geometric Aspects of Functional Analysis (Israel Seminar 2001--2002)","author":"Nazarov Fedor","year":"2003","unstructured":"Fedor Nazarov . On the maximal perimeter of a convex set in Rn with respect to a Gaussian measure . In Geometric Aspects of Functional Analysis (Israel Seminar 2001--2002) , volume 1807\/2003 of Lecture Notes in Mathematics , pages 169 -- 187 . Springer , 2003 . Fedor Nazarov. On the maximal perimeter of a convex set in Rn with respect to a Gaussian measure. In Geometric Aspects of Functional Analysis (Israel Seminar 2001--2002), volume 1807\/2003 of Lecture Notes in Mathematics, pages 169--187. Springer, 2003."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1137\/0222053"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1016\/j.jcss.2004.01.001"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1145\/1374376.1374458"},{"key":"e_1_3_2_1_33_1","volume-title":"Noise stability of weighted majority","author":"Peres Yuval","year":"2004","unstructured":"Yuval Peres . Noise stability of weighted majority , 2004 . http:\/\/arxiv.org\/abs\/math\/0412377\/arXiv:math\/0412377. Yuval Peres. Noise stability of weighted majority, 2004. http:\/\/arxiv.org\/abs\/math\/0412377\/arXiv:math\/0412377."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-7798-6","volume-title":"Approximation Theory in the Central Limit Theorem: Exact Results in Banach Spaces","author":"Paulauskas Vygantas","year":"1989","unstructured":"Vygantas Paulauskas and Alfredas Ra\\vckauskas. Approximation Theory in the Central Limit Theorem: Exact Results in Banach Spaces . Kluwer Academic Publishers , 1989 . (Translated from Russian). Vygantas Paulauskas and Alfredas Ra\\vckauskas. Approximation Theory in the Central Limit Theorem: Exact Results in Banach Spaces. Kluwer Academic Publishers, 1989. (Translated from Russian)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1016\/S0020-0190(00)00069-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_36_1","DOI":"10.4064\/sm180-3-3"},{"key":"e_1_3_2_1_37_1","series-title":"Graduate texts in Mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"http:\/\/www.springer.com\/math\/geometry\/book\/978-0-387-94365-7 Lectures on polytopes","author":"Ziegler G\u00fcnter M.","year":"1995","unstructured":"G\u00fcnter M. Ziegler . http:\/\/www.springer.com\/math\/geometry\/book\/978-0-387-94365-7 Lectures on polytopes , volume 152 of Graduate texts in Mathematics . Springer , 1995 . G\u00fcnter M. Ziegler. http:\/\/www.springer.com\/math\/geometry\/book\/978-0-387-94365-7 Lectures on polytopes, volume 152 of Graduate texts in Mathematics. Springer, 1995."}],"event":{"sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC'10","name":"STOC'10: Symposium on Theory of Computing","location":"Cambridge Massachusetts USA"},"container-title":["Proceedings of the forty-second ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806764","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1806689.1806764","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:39:37Z","timestamp":1750246777000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1806689.1806764"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,6,5]]},"references-count":36,"alternative-id":["10.1145\/1806689.1806764","10.1145\/1806689"],"URL":"https:\/\/doi.org\/10.1145\/1806689.1806764","relation":{},"subject":[],"published":{"date-parts":[[2010,6,5]]},"assertion":[{"value":"2010-06-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}