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

DOI10.1145/3357713.3384255OpenAlexW3035532193MaRDI QIDQ5144971

Weiming Feng, Yitong Yin, Chihao Zhang, Heng Guo

Publication date: 19 January 2021

Published in: Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1911.01319

zbMATH Keywords

Markov chain Monte Carloapproximate countingLovász local lemma\(k\)-SAT

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Counting Solutions to Random CNF Formulas

This page was built for publication: Fast sampling and counting 𝑘-SAT solutions in the local lemma regime