DagRep.5.7.22.pdf
- Filesize: 1.12 MB
- 20 pages
Document
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 5, Issue 7
Volume: Dagstuhl Reports, Volume 5
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2016-01-13
Cite As Get BibTex
Andrei A. Bulatov, Venkatesan Guruswami, Andrei Krokhin, and Dániel Marx. The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301). In Dagstuhl Reports, Volume 5, Issue 7, pp. 22-41, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2016)
https://doi.org/10.4230/DagRep.5.7.22
Abstract
During the past two decades, an impressive array of diverse methods from several different mathematical fields, including algebra, logic, mathematical programming, 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. This research direction develops at an impressive speed, regularly producing very strong and general results. The Dagstuhl Seminar 15301 "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 obtained during the past three years. This report documents the material presented during the course of the seminar.
Subject Classification
Keywords
- Constraint satisfaction problem (CSP)
- Computational complexity
- CSP dichotomy conjecture
- Hardness of approximation
- Unique games conjecture
- Fixed-parameter tractability
- Descriptive complexity
- Universal algebra
- Logic
- Decomposition methods
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads