DFU.Vol7.15301.205.pdf
- Filesize: 0.61 MB
- 27 pages
Document
Counting Constraint Satisfaction Problems
Author
-
Part of:
Volume:
The Constraint Satisfaction Problem: Complexity and Approximability (DFU - Vol. 7)
Series: Dagstuhl Follow-Ups (DFU) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2017-02-21
Cite AsGet BibTex
Mark Jerrum. Counting Constraint Satisfaction Problems. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Follow-Ups, Volume 7, pp. 205-231, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/DFU.Vol7.15301.205
https://doi.org/10.4230/DFU.Vol7.15301.205
Abstract
This chapter surveys counting Constraint Satisfaction Problems (counting CSPs, or #CSPs) and their computational complexity. It aims to provide an introduction to the main concepts and techniques, and present a representative selection of results and open problems. It does not cover holants, which are the subject of a separate chapter.
Keywords
- Approximation algorithms
- Computational complexity
- Constraint satisfaction problems
- Counting problems
- Partition functions
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads