Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH scholarly article en Bulatov, Andrei A.; Grohe, Martin; Kolaitis, Phokion G.; Krokhin, Andrei License
when quoting this document, please refer to the following
DOI:
URN: urn:nbn:de:0030-drops-23706
URL:

; ; ;

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

pdf-format:


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:DagSemProc.09441.2,
  author =	{Bulatov, Andrei A. and Grohe, Martin and Kolaitis, Phokion G. and Krokhin, Andrei},
  title =	{{09441 Executive Summary – The Constraint Satisfaction Problem: Complexity and Approximability}},
  booktitle =	{The Constraint Satisfaction Problem: Complexity and Approximability},
  pages =	{1--2},
  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/2370},
  URN =		{urn:nbn:de:0030-drops-23706},
  doi =		{10.4230/DagSemProc.09441.2},
  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
Seminar: 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