{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:47:14Z","timestamp":1781077634871,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,6,22]],"date-time":"2020-06-22T00:00:00Z","timestamp":1592784000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"National Key R&D Program of China","award":["2018YFB1003202"],"award-info":[{"award-number":["2018YFB1003202"]}]},{"DOI":"10.13039\/501100012659","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61722207,61902241,61672275"],"award-info":[{"award-number":["61722207,61902241,61672275"]}],"id":[{"id":"10.13039\/501100012659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,6,22]]},"DOI":"10.1145\/3357713.3384255","type":"proceedings-article","created":{"date-parts":[[2020,6,7]],"date-time":"2020-06-07T01:45:25Z","timestamp":1591494325000},"page":"854-867","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Fast sampling and counting \ud835\udc58-SAT solutions in the local lemma regime"],"prefix":"10.1145","author":[{"given":"Weiming","family":"Feng","sequence":"first","affiliation":[{"name":"Nanjing University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heng","family":"Guo","sequence":"additional","affiliation":[{"name":"University of Edinburgh, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yitong","family":"Yin","sequence":"additional","affiliation":[{"name":"Nanjing University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chihao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Shanghai Jiao Tong University, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1137\/16M1083906"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/050644033"},{"key":"e_1_3_2_1_3_1","first-page":"223","article-title":"Path coupling: A technique for proving rapid mixing in Markov chains","author":"Bubley Russ","year":"1997","unstructured":"Russ Bubley and Martin Dyer . 1997 . Path coupling: A technique for proving rapid mixing in Markov chains . In FOCS. 223 - 231 . Russ Bubley and Martin Dyer. 1997. Path coupling: A technique for proving rapid mixing in Markov chains. In FOCS. 223-231.","journal-title":"FOCS."},{"key":"e_1_3_2_1_4_1","first-page":"1","article-title":"Fast Algorithms at Low Temperatures via Markov Chains. In APPROX-RANDOM (LIPIcs), Vol. 145","volume":"41","author":"Chen Zongchen","year":"2019","unstructured":"Zongchen Chen , Andreas Galanis , Leslie Ann Goldberg , Will Perkins , James Stewart , and Eric Vigoda . 2019 . Fast Algorithms at Low Temperatures via Markov Chains. In APPROX-RANDOM (LIPIcs), Vol. 145 . Schloss Dagstuhl-LeibnizZentrum f\u00fcr Informatik , 41 : 1 - 41 : 14. Zongchen Chen, Andreas Galanis, Leslie Ann Goldberg, Will Perkins, James Stewart, and Eric Vigoda. 2019. Fast Algorithms at Low Temperatures via Markov Chains. In APPROX-RANDOM (LIPIcs), Vol. 145. Schloss Dagstuhl-LeibnizZentrum f\u00fcr Informatik, 41 : 1-41 : 14.","journal-title":"Schloss Dagstuhl-LeibnizZentrum f\u00fcr Informatik"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/102782.102783"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/17M1127144"},{"key":"e_1_3_2_1_7_1","volume-title":"Fast sampling and counting k-SAT solutions in the local lemma regime. CoRR abs\/","author":"Feng Weiming","year":"1911","unstructured":"Weiming Feng , Heng Guo , Yitong Yin , and Chihao Zhang . 2019. Fast sampling and counting k-SAT solutions in the local lemma regime. CoRR abs\/ 1911 .01319 ( 2019 ). arXiv: 1911.01319 Weiming Feng, Heng Guo, Yitong Yin, and Chihao Zhang. 2019. Fast sampling and counting k-SAT solutions in the local lemma regime. CoRR abs\/ 1911.01319 ( 2019 ). arXiv: 1911.01319"},{"key":"e_1_3_2_1_8_1","volume-title":"Frieze and Michael Anastos","author":"Alan","year":"2017","unstructured":"Alan M. Frieze and Michael Anastos . 2017 . Randomly coloring simple hypergraphs with fewer colors. Inf. Process. Lett . 126 ( 2017 ), 39-42. Alan M. Frieze and Michael Anastos. 2017. Randomly coloring simple hypergraphs with fewer colors. Inf. Process. Lett. 126 ( 2017 ), 39-42."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1214\/17-AAP1335"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/3310131"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1202955"},{"key":"e_1_3_2_1_12_1","volume-title":"Harris","author":"Haeupler Bernhard","year":"2017","unstructured":"Bernhard Haeupler and David G . Harris . 2017 . Parallel algorithms and concentration bounds for the Lov\u00e1sz Local Lemma via witness-DAGs. In SODA. SIAM , 1170-1187. Bernhard Haeupler and David G. Harris. 2017. Parallel algorithms and concentration bounds for the Lov\u00e1sz Local Lemma via witness-DAGs. In SODA. SIAM, 1170-1187."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2049697.2049702"},{"key":"e_1_3_2_1_14_1","first-page":"1009","article-title":"Algorithmic Pirogov-Sinai theory","author":"Helmuth Tyler","year":"2019","unstructured":"Tyler Helmuth , Will Perkins , and Guus Regts . 2019 . Algorithmic Pirogov-Sinai theory . In STOC. ACM , 1009 - 1020 . Tyler Helmuth, Will Perkins, and Guus Regts. 2019. Algorithmic Pirogov-Sinai theory. In STOC. ACM, 1009-1020.","journal-title":"STOC. ACM"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Jonathan Hermon Allan Sly and Yumeng Zhang. 2019. Rapid mixing of hypergraph independent sets. Random Struct. Algorithms 54 4 ( 2019 ) 730-767.  Jonathan Hermon Allan Sly and Yumeng Zhang. 2019. Rapid mixing of hypergraph independent sets. Random Struct. Algorithms 54 4 ( 2019 ) 730-767.","DOI":"10.1002\/rsa.20830"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Mark Huber. 2015. Approximation algorithms for the normalizing constant of Gibbs distributions. Ann. Appl. Probab. 25 2 ( 2015 ) 974-985.  Mark Huber. 2015. Approximation algorithms for the normalizing constant of Gibbs distributions. Ann. Appl. Probab. 25 2 ( 2015 ) 974-985.","DOI":"10.1214\/14-AAP1015"},{"key":"e_1_3_2_1_17_1","volume-title":"Algorithms for #BIShard problems on expander graphs","author":"Jenssen Matthew","unstructured":"Matthew Jenssen , Peter Keevash , and Will Perkins . 2019. Algorithms for #BIShard problems on expander graphs . In SODA. SIAM , 2235-2247. Matthew Jenssen, Peter Keevash, and Will Perkins. 2019. Algorithms for #BIShard problems on expander graphs. In SODA. SIAM, 2235-2247."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/0222066"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1008731.1008738"},{"key":"e_1_3_2_1_20_1","volume-title":"Vazirani","author":"Jerrum Mark R.","year":"1986","unstructured":"Mark R. Jerrum , Leslie G. Valiant , and Vijay V . Vazirani . 1986 . Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci . 43 ( 1986 ), 169-188. Mark R. Jerrum, Leslie G. Valiant, and Vijay V. Vazirani. 1986. Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43 ( 1986 ), 169-188."},{"key":"e_1_3_2_1_21_1","first-page":"228","article-title":"A Faster Approximation Algorithm for the Gibbs Partition Function","author":"Kolmogorov Vladimir","year":"2018","unstructured":"Vladimir Kolmogorov . 2018 . A Faster Approximation Algorithm for the Gibbs Partition Function . In COLT. 228 - 249 . Vladimir Kolmogorov. 2018. A Faster Approximation Algorithm for the Gibbs Partition Function. In COLT. 228-249.","journal-title":"COLT."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"David A Levin and Yuval Peres. 2017. Markov chains and mixing times. American Mathematical Soc.  David A Levin and Yuval Peres. 2017. Markov chains and mixing times. American Mathematical Soc.","DOI":"10.1090\/mbk\/107"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3268930"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516512.1516520"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"crossref","unstructured":"Robert Swendsen and Jian-Sheng Wang. 1987. Nonuniversal critical dynamics in Monte Carlo simulations. Phys. Rev. Lett. 58 ( 1987 ) 86-88. Issue 2.  Robert Swendsen and Jian-Sheng Wang. 1987. Nonuniversal critical dynamics in Monte Carlo simulations. Phys. Rev. Lett. 58 ( 1987 ) 86-88. Issue 2.","DOI":"10.1103\/PhysRevLett.58.86"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1145\/1132516.1132538","article-title":"Counting independent sets up to the tree threshold","author":"Weitz Dror","year":"2006","unstructured":"Dror Weitz . 2006 . Counting independent sets up to the tree threshold . In STOC. ACM , 140 - 149 . Dror Weitz. 2006. Counting independent sets up to the tree threshold. In STOC. ACM, 140-149.","journal-title":"STOC. ACM"},{"key":"e_1_3_2_1_28_1","volume-title":"Mathematics and Computation: A Theory Revolutionizing Technology and Science","author":"Wigderson Avi","unstructured":"Avi Wigderson . 2019. Mathematics and Computation: A Theory Revolutionizing Technology and Science . Princeton University Press . Avi Wigderson. 2019. Mathematics and Computation: A Theory Revolutionizing Technology and Science. Princeton University Press."}],"event":{"name":"STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing","location":"Chicago IL USA","acronym":"STOC '20","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384255","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3357713.3384255","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:12Z","timestamp":1750200072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3357713.3384255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6,22]]},"references-count":28,"alternative-id":["10.1145\/3357713.3384255","10.1145\/3357713"],"URL":"https:\/\/doi.org\/10.1145\/3357713.3384255","relation":{},"subject":[],"published":{"date-parts":[[2020,6,22]]},"assertion":[{"value":"2020-06-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}