@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}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode