Counting Constraint Satisfaction Problems
Mark Jerrum · DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2017
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.