Complexity: knots, colourings and counting
Complexity: knots, colourings and counting
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
The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
Computational Complexity
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
The Computational Complexity of ({\it XOR, AND\/})-Counting Problems
The Computational Complexity of ({\'it XOR, AND\'/})-Counting Problems
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)
Inapproximability of the Tutte polynomial
Information and Computation
The Complexity of the Counting Constraint Satisfaction Problem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Holographic reduction: a domain changed application and its partial converse theorems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
The complexity of weighted and unweighted #CSP
Journal of Computer and System Sciences
The complexity of planar boolean #CSP with complex weights
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
The complexity of complex weighted Boolean #CSP
Journal of Computer and System Sciences
Hi-index | 5.23 |
We give a complexity dichotomy for the problem of computing the partition function of a weighted Boolean constraint satisfaction problem. Such a problem is parameterized by a set @C of rational-valued functions, which generalize constraints. Each function assigns a weight to every assignment to a set of Boolean variables. Our dichotomy extends previous work in which the weight functions were restricted to being non-negative. We represent a weight function as a product of the form (-1)^sg, where the polynomial s determines the sign of the weight and the non-negative function g determines its magnitude. We show that the problem of computing the partition function (the sum of the weights of all possible variable assignments) is in polynomial time if either every function in @C can be defined by a ''pure affine'' magnitude with a quadratic sign polynomial or every function can be defined by a magnitude of ''product type'' with a linear sign polynomial. In all other cases, computing the partition function is FP^#^P-complete.