Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/DFU.Vol7.15301.205
URN: urn:nbn:de:0030-drops-69655
URL: https://drops.dagstuhl.de/opus/volltexte/2017/6965/
Jerrum, Mark
Counting Constraint Satisfaction Problems
| pdf-format: |
|
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.
BibTeX - Entry
@InCollection{jerrum:DFU:2017:6965,
author = {Mark Jerrum},
title = {{Counting Constraint Satisfaction Problems}},
booktitle = {The Constraint Satisfaction Problem: Complexity and Approximability},
pages = {205--231},
series = {Dagstuhl Follow-Ups},
ISBN = {978-3-95977-003-3},
ISSN = {1868-8977},
year = {2017},
volume = {7},
editor = {Andrei Krokhin and Stanislav Zivny},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/6965},
URN = {urn:nbn:de:0030-drops-69655},
doi = {10.4230/DFU.Vol7.15301.205},
annote = {Keywords: Approximation algorithms, Computational complexity, Constraint satisfaction problems, Counting problems, Partition functions}
}
| Keywords: | Approximation algorithms, Computational complexity, Constraint satisfaction problems, Counting problems, Partition functions | |
| Seminar: | The Constraint Satisfaction Problem: Complexity and Approximability | |
| Issue date: | 2017 | |
| Date of publication: | 21.02.2017 |
