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#R##N#of algorithmic tasks related to the constraint satisfaction problem (CSP),#R##N#as well as the applicability/limitations of algorithmic techniques.#R##N#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#R##N#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.
['Andrei A. Bulatov', 'Venkatesan Guruswami', 'Andrei A. Krokhin', 'Dániel Marx']
The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 12451)