Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models
© 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM. In this article, we introduce a new approach to approximate counting in bounded degree systems with higher-order constraints. Our main result is an algorithm to approximately count the number of solutions to a CNF form...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Association for Computing Machinery (ACM)
2021
|
| Online Access: | https://hdl.handle.net/1721.1/136182 |