@Article{bulatov_et_al:DagRep.5.7.22,
author = {Bulatov, Andrei A. and Guruswami, Venkatesan and Krokhin, Andrei and Marx, D\'{a}niel},
title = {{The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301)}},
pages = {22--41},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2016},
volume = {5},
number = {7},
editor = {Bulatov, Andrei A. and Guruswami, Venkatesan and Krokhin, Andrei and Marx, D\'{a}niel},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.5.7.22},
URN = {urn:nbn:de:0030-drops-56714},
doi = {10.4230/DagRep.5.7.22},
annote = {Keywords: Constraint satisfaction problem (CSP), Computational complexity, CSP dichotomy conjecture, Hardness of approximation, Unique games conjecture, Fixed-parameter tractability, Descriptive complexity, Universal algebra, Logic, Decomposition methods}
}