The #CSP Dichotomy is Decidable

Authors Martin Dyer, David Richerby

Thumbnail PDF


  • Filesize: 0.6 MB
  • 12 pages

Document Identifiers

Author Details

Martin Dyer
David Richerby

Cite AsGet BibTex

Martin Dyer and David Richerby. The #CSP Dichotomy is Decidable. In 28th International Symposium on Theoretical Aspects of Computer Science (STACS 2011). Leibniz International Proceedings in Informatics (LIPIcs), Volume 9, pp. 261-272, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)


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


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads