Communication Dans Un Congrès Année : 2011

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{}.

Fichier principal
Vignette du fichier
26.pdf (246.5 Ko) Télécharger le fichier
Origine Accord explicite pour ce dépôt
Licence
Loading...

Dates et versions

hal-00573600 , version 1 (04-03-2011)

Licence

Identifiants

  • HAL Id : hal-00573600 , version 1

Citer

Martin Dyer, David Richerby. The \#CSP Dichotomy is Decidable. Symposium on Theoretical Aspects of Computer Science (STACS2011), Mar 2011, Dortmund, Germany. pp.261-272. ⟨hal-00573600⟩

Collections

127 Consultations
155 Téléchargements

Partager

  • More