Abstract
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
Author supplied keywords
Cite
CITATION STYLE
APA
Feng, W., Guo, H., Yin, Y., & Zhang, C. (2020). Fast sampling and counting K-SAT solutions in the local lemma regime. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. 854–867). Association for Computing Machinery. https://doi.org/10.1145/3357713.3384255
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free