@Article{hastad_et_al:DagRep.2.11.1,
author = {Hastad, Johan and Krokhin, Andrei and Marx, D\'{a}niel},
title = {{The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451)}},
pages = {1--19},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2013},
volume = {2},
number = {11},
editor = {Hastad, Johan 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.2.11.1},
URN = {urn:nbn:de:0030-drops-39764},
doi = {10.4230/DagRep.2.11.1},
annote = {Keywords: Constraint satisfaction problem (CSP); Computational complexity; CSP dichotomy conjecture; Hardness of approximation; Unique games conjceture; Fixed-parameter tractability; Descriptive complexity; niversal algebra; Logic; Decomposition methods}
}