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

DOI10.1145/3357713.3384255MaRDI QIDQ5144971zbMATH OpenOpenAlexFDO

Authors Weiming Feng, Heng Guo, Yitong Yin, Chihao Zhang

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

\(k\)-SATapproximate countingLovász local lemmaMarkov chain Monte Carlo

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cited in

(1)

• Counting solutions to random CNF formulas

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144971)