2010/01/01 by Andreǐ A. Bulatov, Martin Grohe, Bulatov, Andrei A. +5
Computer Science · #CSP dichotomy conjecture #Constraint Satisfaction and Optimization #Constraint satisfaction problem (CSP) #computational complexity #hardness of approximation #logic #satisfiability #unique games conjecture #universal algebra
paper · doi:10.4230/dagsemproc.09441.2
openalex publication_date 2010/01/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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.