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

DOI10.1145/3469832zbMath1499.68240OpenAlexW3203800035MaRDI QIDQ5056428

Yitong Yin, Chihao Zhang, Heng Guo, Weiming Feng

Publication date: 8 December 2022

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/3469832

zbMATH Keywords

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

Mathematics Subject Classification ID

Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Computational aspects of satisfiability (68R07)

This page was built for publication: Fast Sampling and Counting k -SAT Solutions in the Local Lemma Regime