Random generation of combinatorial structures from a uniform
Theoretical Computer Science
Complexity of generalized satisfiability counting problems
Information and Computation
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
The complexity of counting graph homomorphisms
Proceedings of the ninth international conference on on Random structures and algorithms
Complexity classifications of boolean constraint satisfaction problems
Complexity classifications of boolean constraint satisfaction problems
The complexity of satisfiability problems
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Towards a Dichotomy Theorem for the Counting Constraint Satisfaction Problem
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
The complexity of partition functions
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
Handbook of Constraint Programming (Foundations of Artificial Intelligence)
The Complexity of the Counting Constraint Satisfaction Problem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
The Complexity of Weighted Boolean CSP
SIAM Journal on Computing
Information Processing Letters
A trichotomy theorem for the approximate counting of complex-weighted bounded-degree boolean CSPs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part I
Approximate counting for complex-weighted Boolean constraint satisfaction problems
WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Approximate counting via correlation decay in spin systems
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
The complexity of weighted and unweighted #CSP
Journal of Computer and System Sciences
Dichotomy for Holant problems of Boolean domain
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
A dichotomy theorem for the approximate counting of complex-weighted bounded-degree Boolean CSPs
Theoretical Computer Science
Approximate counting for complex-weighted Boolean constraint satisfaction problems
Information and Computation
Approximation complexity of complex-weighted degree-two counting constraint satisfaction problems
Theoretical Computer Science
The complexity of approximating bounded-degree Boolean #CSP
Information and Computation
The complexity of the counting constraint satisfaction problem
Journal of the ACM (JACM)
The expressibility of functions on the boolean domain, with applications to counting CSPs
Journal of the ACM (JACM)
Hi-index | 0.00 |
We give a trichotomy theorem for the complexity of approximately counting the number of satisfying assignments of a Boolean CSP instance. Such problems are parameterised by a constraint language specifying the relations that may be used in constraints. If every relation in the constraint language is affine then the number of satisfying assignments can be exactly counted in polynomial time. Otherwise, if every relation in the constraint language is in the co-clone IM"2 from Post's lattice, then the problem of counting satisfying assignments is complete with respect to approximation-preserving reductions for the complexity class #RH@P"1. This means that the problem of approximately counting satisfying assignments of such a CSP instance is equivalent in complexity to several other known counting problems, including the problem of approximately counting the number of independent sets in a bipartite graph. For every other fixed constraint language, the problem is complete for #P with respect to approximation-preserving reductions, meaning that there is no fully polynomial randomised approximation scheme for counting satisfying assignments unless NP=RP.