The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451)

Authors Johan Hastad, Andrei Krokhin, Dániel Marx and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.2.11.1.pdf
  • Filesize: 0.81 MB
  • 19 pages

Document Identifiers

Author Details

Johan Hastad
Andrei Krokhin
Dániel Marx
and all authors of the abstracts in this report

Cite AsGet BibTex

Johan Hastad, Andrei Krokhin, and Dániel Marx. The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451). In Dagstuhl Reports, Volume 2, Issue 11, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/DagRep.2.11.1

Abstract

During the past two decades, an impressive array of diverse methods from several different mathematical fields, including algebra, logic, analysis, probability theory, graph theory, and combinatorics, have been used to analyze both the computational complexity and approximabilty of algorithmic tasks related to the constraint satisfaction problem (CSP), as well as the applicability/limitations of algorithmic techniques. The Dagstuhl Seminar 12451 ``The Constraint Satisfaction Problem: Complexity and Approximability'' was aimed at bringing together researchers using all the different techniques in the study of the CSP, so that they can share their insights. This report documents the material presented during the course of the seminar.
Keywords
  • Constraint satisfaction problem (CSP); Computational complexity; CSP dichotomy conjecture; Hardness of approximation; Unique games conjceture; Fixed-parameter tractability; Descriptive complexity; niversal algebra; Logic; Decomposition methods

Metrics

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