An Effective Dichotomy for the Counting Constraint Satisfaction Problem
An Effective Dichotomy for the Counting Constraint Satisfaction Problem
Bulatov [Proceedings of the $35$th International Colloquium on Automata, Languages and Programming (Part 1), Lecture Notes in Comput. Sci. 5125, Springer, New York, 2008, pp. 646--661] gave a dichotomy for the counting constraint satisfaction problem \#CSP. A problem from \#CSP is characterized by a constraint language $\Gamma\!$, a fixed, finite …