License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09441.1
URN: urn:nbn:de:0030-drops-23710
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2371/
Go to the corresponding Portal

Bulatov, Andrei A. ; Grohe, Martin ; Kolaitis, Phokion G. ; Krokhin, Andrei

09441 Abstracts Collection -- The Constraint Satisfaction Problem: Complexity and Approximability

pdf-format:
09441_abstracts_collection.2371.pdf (0.2 MB)

Abstract

From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Complexity and Approximability'' was held
in Schloss Dagstuhl~--~Leibniz Center for Informatics.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.

BibTeX - Entry

@InProceedings{bulatov_et_al:DagSemProc.09441.1,
  author =	{Bulatov, Andrei A. and Grohe, Martin and Kolaitis, Phokion G. and Krokhin, Andrei},
  title =	{{09441 Abstracts Collection – The Constraint Satisfaction Problem: Complexity and Approximability}},
  booktitle =	{The Constraint Satisfaction Problem: Complexity and Approximability},
  pages =	{1--14},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9441},
  editor =	{Andrei A. Bulatov and Martin Grohe and Phokion G. Kolaitis and Andrei Krokhin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2010/2371},
  URN =		{urn:nbn:de:0030-drops-23710},
  doi =		{10.4230/DagSemProc.09441.1},
  annote =	{Keywords: Constraint satisfaction problem (CSP), satisfiability, computational complexity, CSP dichotomy conjecture, hardness of approximation, unique games conjecture, universal algebra, logic}
}

Keywords: Constraint satisfaction problem (CSP), satisfiability, computational complexity, CSP dichotomy conjecture, hardness of approximation, unique games
Freie Schlagwörter (englisch): conjecture, universal algebra, logic
Collection: 09441 - The Constraint Satisfaction Problem: Complexity and Approximability
Issue Date: 2010
Date of publication: 07.01.2010

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI