License
when quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-23710
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2371/

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

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

pdf-format:
Dokument 1.pdf (209 KB)


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:DSP:2010:2371,
  author =	{Andrei A. Bulatov and Martin Grohe and Phokion G. Kolaitis and Andrei Krokhin},
  title =	{09441 Abstracts Collection -- The Constraint Satisfaction Problem: Complexity and Approximability},
  booktitle =	{The Constraint Satisfaction Problem: Complexity and Approximability},
  year =	{2010},
  editor =	{Andrei A. Bulatov and Martin Grohe and Phokion G. Kolaitis and Andrei Krokhin},
  number =	{09441},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2371},
  annote =	{Keywords: Constraint satisfaction problem (CSP), satisfiability, computational complexity, CSP dichotomy conjecture, hardness of approximation, unique games}
}

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


DROPS-Home | Fulltext Search | Imprint Published by LZI