EUVIMEDEUVIMED entdecken
Crossref

Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime

Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang

Journal of the ACM · 31.12.2021 · 68 (6) · 1-42

DOI: 10.1145/3469832 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Journal of the ACM, online erschienen am 05.10.2021. Verfasst von Weiming Feng und 3 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 33 Literaturangaben. Gefördert von: National Key R&D Program of China, NSFC, European Research Council.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We give new algorithms based on Markov chains to sample and approximately count satisfying assignments to k -uniform CNF formulas where each variable appears at most d times. For any k and d satisfying kd < n o(1) and k ≥ 20 log k + 20 log d + 60, the new sampling algorithm runs in close to linear time, and the counting algorithm runs in close to quadratic time. Our approach is inspired by Moitra (JACM, 2019), which remarkably utilizes the Lovász local lemma in approximate counting. Our main technical contribution is to use the local lemma to bypass the connectivity barrier in traditional Markov chain approaches, which makes the well-developed MCMC method applicable on disconnected state spaces such as SAT solutions. The benefit of our approach is to avoid the enumeration of local structures and obtain fixed polynomial running times, even if k = ω (1) or d = ω (1).

Förderung

  • National Key R&D Program of China
  • NSFC
  • European Research Council

Zitieren

APA

Feng, W., Guo, H., Yin, Y., & Zhang, C. (2021). Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime. Journal of the ACM, 68(6), 1-42. https://doi.org/10.1145/3469832

Vancouver

Feng W, Guo H, Yin Y, Zhang C. Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime. Journal of the ACM. 2021;68(6):1-42. doi:10.1145/3469832

BibTeX
@article{Feng2021,
  author = {Feng, Weiming and Guo, Heng and Yin, Yitong and Zhang, Chihao},
  title = {Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime},
  journal = {Journal of the ACM},
  year = {2021},
  volume = {68},
  number = {6},
  pages = {1--42},
  doi = {10.1145/3469832}
}
Kostenlos starten →