The Complexity of #CSP

Authors:

Abstract
Bulatov (2008) has given a dichotomy for the counting constraint satisfaction problem (#CSP). A problem from #CSP is characterised by a constraint language, a fixed, finite set of relations over a finite domain. An instance of the problem uses these relations to constrain the variables in a larger set. Bulatov showed that the problem of counting the satisfying assignments of instances of any problem from #CSP is either in polynomial time (FP) or is #P-complete. His proof draws heavily on techniques from universal algebra and cannot be understood without a secure grasp of that field. We give an elementary proof of Bulatov's dichotomy, based on succinct representations, which we call frames, of a class of highly structured relations, which we call strongly rectangular. We show that these are precisely the relations which are invariant under a Mal'tsev polymorphism. En route, we give a simplification of a decision algorithm for strongly rectangular constraint languages due to Bulatov and Dalmau (2006).

This publication has 14 references indexed in Scilit: