The #CSP Dichotomy is Decidable
Bulatov (2008) and Dyer and Richerby (2010) have established the following dichotomy for the counting constraint satisfaction problem (#CSP): for any constraint language Gamma, the
problem of computing the number of satisfying assignments to constraints drawn from Gamma is either in FP or is #P-complete, depending on the structure of Gamma. The principal question left open by this research was whether the criterion of the dichotomy is decidable. We show that it is; in fact, it is in NP.
constraint satisfaction problem
counting problems
complexity dichotomy
decidability
261-272
Regular Paper
Martin
Dyer
Martin Dyer
David
Richerby
David Richerby
10.4230/LIPIcs.STACS.2011.261
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode