DagSemProc.09441.1.pdf
- Filesize: 209 kB
- 14 pages
Document
09441 Abstracts Collection – The Constraint Satisfaction Problem: Complexity and Approximability
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9441
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2010-01-07
Cite AsGet BibTex
Andrei A. Bulatov, Martin Grohe, Phokion G. Kolaitis, and Andrei Krokhin. 09441 Abstracts Collection – The Constraint Satisfaction Problem: Complexity and Approximability. In The Constraint Satisfaction Problem: Complexity and Approximability. Dagstuhl Seminar Proceedings, Volume 9441, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.09441.1
https://doi.org/10.4230/DagSemProc.09441.1
Abstract
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.
Keywords
- Constraint satisfaction problem (CSP)
- satisfiability
- computational complexity
- CSP dichotomy conjecture
- hardness of approximation
- unique games conjecture
- universal algebra
- logic
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads