The Complexity of Approximating Bounded-Degree Boolean #CSP

Martin Dyer, Leslie Ann Goldberg, Markus Jalsenius & David Richerby
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs with bounded-degree instances, for constraint languages containing the two unary constant relations $\{0\}$ and $\{1\}$. When the maximum degree is at least $25$ we obtain a complete classification of the complexity of this problem. It is exactly solvable in polynomial-time if every relation in...
This data repository is not currently reporting usage information. For information on how your repository can submit usage information, please see our documentation.