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

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



PDF
Thumbnail PDF

File

DagSemProc.09441.2.pdf
  • Filesize: 73 kB
  • 2 pages

Document Identifiers

Author Details

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

Cite AsGet BibTex

Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, and Andrei Krokhin. 09441 Executive Summary – The Constraint Satisfaction Problem: Complexity and Approximability. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Seminar Proceedings, Volume 9441, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.09441.2

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.
Keywords
  • Constraint satisfaction problem (CSP)
  • satisfiability
  • computational complexity
  • CSP dichotomy conjecture
  • hardness of approximation
  • unique games conjecture
  • universal algebra
  • logic

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads