2022/01/26 by Bulatov, Andrei A., Grohe, Martin, Kolaitis, Phokion G. +1
#CSP dichotomy conjecture #Constraint satisfaction problem (CSP) #computational complexity #hardness of approximation #logic #satisfiability #unique games conjecture #universal algebra
paper · doi:10.4230/dagsemproc.09441.1
From 25th to 30th October 2009, the Dagstuhl Seminar 09441 ``The Constraint Satisfaction Problem: Complexity and Approximability'' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.