{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:32:54Z","timestamp":1767007974499,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T00:00:00Z","timestamp":1654732800000},"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":[[2022,6,9]]},"DOI":"10.1145\/3519935.3519957","type":"proceedings-article","created":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T15:29:32Z","timestamp":1654874972000},"page":"1473-1486","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Approximate counting and sampling via local central limit theorems"],"prefix":"10.1145","author":[{"given":"Vishesh","family":"Jain","sequence":"first","affiliation":[{"name":"Stanford University, USA"}]},{"given":"Will","family":"Perkins","sequence":"additional","affiliation":[{"name":"University of Illinois at Chicago, USA"}]},{"given":"Ashwin","family":"Sah","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]},{"given":"Mehtaab","family":"Sawhney","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology, USA"}]}],"member":"320","published-online":{"date-parts":[[2022,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384317"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451123"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00125"},{"volume-title":"Combinatorics and complexity of partition functions. 9","author":"Barvinok Alexander","key":"e_1_3_2_1_4_1","unstructured":"Alexander Barvinok . 2016. Combinatorics and complexity of partition functions. 9 , Springer . Alexander Barvinok. 2016. Combinatorics and complexity of partition functions. 9, Springer."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250809"},{"key":"e_1_3_2_1_6_1","unstructured":"Ross Berkowitz. 2016. A quantitative local limit theorem for triangles in random graphs. arXiv preprint arXiv:1610.01281.  Ross Berkowitz. 2016. A quantitative local limit theorem for triangles in random graphs. arXiv preprint arXiv:1610.01281."},{"key":"e_1_3_2_1_7_1","article-title":"Inapproximability of the independent set polynomial in the complex plane","volume":"49","author":"Bez\u00e1kov\u00e1 Ivona","year":"2019","unstructured":"Ivona Bez\u00e1kov\u00e1 , Andreas Galanis , Leslie Ann Goldberg , and Daniel Stefankovic . 2019 . Inapproximability of the independent set polynomial in the complex plane . SIAM J. Comput. , 49 , 5 (2019), STOC18\u2013395\u2013STOC18\u2013448. Ivona Bez\u00e1kov\u00e1, Andreas Galanis, Leslie Ann Goldberg, and Daniel Stefankovic. 2019. Inapproximability of the independent set polynomial in the complex plane. SIAM J. Comput., 49, 5 (2019), STOC18\u2013395\u2013STOC18\u2013448.","journal-title":"SIAM J. Comput."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646111"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976465.91"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.88"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3406325.3451035"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2006.06.001"},{"key":"e_1_3_2_1_13_1","series-title":"Series B.","volume-title":"to appear. A proof of the Upper Matching Conjecture for large graphs. Journal of Combinatorial Theory","author":"Davies Ewan","unstructured":"Ewan Davies , Matthew Jenssen , and Will Perkins . to appear. A proof of the Upper Matching Conjecture for large graphs. Journal of Combinatorial Theory , Series B. Ewan Davies, Matthew Jenssen, and Will Perkins. to appear. A proof of the Upper Matching Conjecture for large graphs. Journal of Combinatorial Theory, Series B."},{"key":"e_1_3_2_1_14_1","volume-title":"48th International Colloquium on Automata, Languages, and Programming (ICALP). 198","author":"Davies Ewan","year":"2021","unstructured":"Ewan Davies and Will Perkins . 2021 . Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. In 48th International Colloquium on Automata, Languages, and Programming (ICALP). 198 , 62:1\u201362:18. Ewan Davies and Will Perkins. 2021. Approximately Counting Independent Sets of a Given Size in Bounded-Degree Graphs. In 48th International Colloquium on Automata, Languages, and Programming (ICALP). 198, 62:1\u201362:18."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/trans2\/177\/05"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01614136"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48971-0_57"},{"volume-title":"Statistical Mechanics of Lattice Systems: a Concrete Mathematical Introduction","author":"Friedli Sacha","key":"e_1_3_2_1_18_1","unstructured":"Sacha Friedli and Yvan Velenik . 2017. Statistical Mechanics of Lattice Systems: a Concrete Mathematical Introduction . Cambridge University Press . Sacha Friedli and Yvan Velenik. 2017. Statistical Mechanics of Lattice Systems: a Concrete Mathematical Introduction. Cambridge University Press."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548315000401"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS46700.2020.00127"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579458"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975031.102"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01877590"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00440-019-00928-y"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1112\/jlms.12331"},{"key":"e_1_3_2_1_26_1","unstructured":"Matthew Jenssen Will Perkins and Aditya Potukuchi. 2021. Independent sets of a given size and structure in the hypercube. arXiv preprint arXiv:2106.09709.  Matthew Jenssen Will Perkins and Aditya Potukuchi. 2021. Independent sets of a given size and structure in the hypercube. arXiv preprint arXiv:2106.09709."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218077"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008738"},{"key":"e_1_3_2_1_29_1","unstructured":"Pieter Kasteleyn. 1967. Graph theory and crystal physics. Graph Theory and Theoretical Physics 43\u2013110.  Pieter Kasteleyn. 1967. Graph theory and crystal physics. Graph Theory and Theoretical Physics 43\u2013110."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01211762"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2016.02.009"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10955-018-2199-2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.1750822"},{"key":"e_1_3_2_1_34_1","unstructured":"Marcus Michelen and Julian Sahasrabudhe. [n. d.]. Central limit theorems and the geometry of polynomials.  Marcus Michelen and Julian Sahasrabudhe. [n. d.]. Central limit theorems and the geometry of polynomials."},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1101003"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1307\/mmj\/1541667626"},{"volume-title":"Sums of independent random variables","author":"Petrov V. V.","key":"e_1_3_2_1_37_1","unstructured":"V. V. Petrov . 1975. Sums of independent random variables . Springer-Verlag , New York-Heidelberg. Translated from the Russian by A. A. Brown V. V. Petrov. 1975. Sums of independent random variables. Springer-Verlag, New York-Heidelberg. Translated from the Russian by A. A. Brown"},{"key":"e_1_3_2_1_38_1","unstructured":"Ashwin Sah and Mehtaab Sawhney. [n. d.]. Local limit theorems for subgraph counts.  Ashwin Sah and Mehtaab Sawhney. [n. d.]. Local limit theorems for subgraph counts."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579368"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.34"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOP888"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516520"},{"key":"e_1_3_2_1_43_1","volume-title":"Latin American Symposium on Theoretical Informatics. 873\u2013885","author":"\u0160tefankovi\u010d Daniel","year":"2018","unstructured":"Daniel \u0160tefankovi\u010d , Eric Vigoda , and John Wilmes . 2018 . On counting perfect matchings in general graphs . In Latin American Symposium on Theoretical Informatics. 873\u2013885 . Daniel \u0160tefankovi\u010d, Eric Vigoda, and John Wilmes. 2018. On counting perfect matchings in general graphs. In Latin American Symposium on Theoretical Informatics. 873\u2013885."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(79)90044-6"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132538"}],"event":{"name":"STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Rome Italy","acronym":"STOC '22"},"container-title":["Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519957","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3519935.3519957","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:38Z","timestamp":1750268978000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3519935.3519957"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,9]]},"references-count":45,"alternative-id":["10.1145\/3519935.3519957","10.1145\/3519935"],"URL":"https:\/\/doi.org\/10.1145\/3519935.3519957","relation":{},"subject":[],"published":{"date-parts":[[2022,6,9]]},"assertion":[{"value":"2022-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}