License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-23706
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2370/
Go to the corresponding Portal

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

09441 Executive Summary -- The Constraint Satisfaction Problem: Complexity and Approximability

pdf-format:
Document 1.pdf (74 KB)

Abstract

The seminar brought together forty researchers from diŽerent highly advanced areas of constraint satisfaction and with complementary ex- pertise (logical, algebraic, combinatorial, probabilistic aspects). The list of participants contained both senior and junior researchers and a small number of advanced graduate students.

BibTeX - Entry

@InProceedings{bulatov_et_al:DSP:2010:2370,
  author =	{Andrei A. Bulatov and Martin Grohe and Phokion G. Kolaitis and Andrei Krokhin},
  title =	{09441 Executive Summary -- 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/2370},
  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