Fast sampling and counting 𝑘-SAT solutions in the local lemma regime-Reference-Cited by-同舟云学术

Fast sampling and counting 𝑘-SAT solutions in the local lemma regime

Published:2020-06-06 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
language:
Short-container-title:

Author:

Feng Weiming¹,Guo Heng²,Yin Yitong¹,Zhang Chihao³

Affiliation:

1. Nanjing University, China

2. University of Edinburgh, UK

3. Shanghai Jiao Tong University, China

Funder

National Key R&D Program of China

National Natural Science Foundation of China

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3357713.3384255

Reference28 articles.

1. Approximation via Correlation Decay When Strong Spatial Mixing Fails

2. Accelerating Simulated Annealing for the Permanent and Combinatorial Counting Problems

3. 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.

4. Fast Algorithms at Low Temperatures via Markov Chains. In APPROX-RANDOM (LIPIcs), Vol. 145;Chen Zongchen;Schloss Dagstuhl - Leibniz-Zentrum für Informatik,2019

5. A random polynomial-time algorithm for approximating the volume of convex bodies

Cited by 4 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Towards the sampling Lovász Local Lemma;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02

2. Perfectly sampling k ≥ (8/3 + o (1))Δ-colorings in graphs;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

3. Sampling constraint satisfaction solutions in the local lemma regime;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15

4. Counting Solutions to Random CNF Formulas;SIAM Journal on Computing;2021-01