The \#CSP Dichotomy is Decidable
Résumé
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 \numpc{}, 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{}.
Origine : Accord explicite pour ce dépôt
Loading...