@Article{grohe_et_al:DagRep.12.5.112,
author = {Grohe, Martin and Guruswami, Venkatesan and Marx, D\'{a}niel and \v{Z}ivn\'{y}, Stanislav},
title = {{The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201)}},
pages = {112--130},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2022},
volume = {12},
number = {5},
editor = {Grohe, Martin and Guruswami, Venkatesan and Marx, D\'{a}niel and \v{Z}ivn\'{y}, Stanislav},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagRep.12.5.112},
URN = {urn:nbn:de:0030-drops-174453},
doi = {10.4230/DagRep.12.5.112},
annote = {Keywords: Constraint satisfaction problem (CSP); Computational complexity; Hardness of approximation; Universal algebra; Semidefinite programming}
}