DagRep.2.11.87.pdf
- Filesize: 1.36 MB
- 15 pages
Document
SAT Interactions (Dagstuhl Seminar 12471)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 2, Issue 11
Volume: Dagstuhl Reports, Volume 2
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
- Publication Date: 2013-03-25
Cite As Get BibTex
Nadia Creignou, Nicola Galesi, Oliver Kullmann, and Heribert Vollmer. SAT Interactions (Dagstuhl Seminar 12471). In Dagstuhl Reports, Volume 2, Issue 11, pp. 87-101, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)
https://doi.org/10.4230/DagRep.2.11.87
Abstract
This report documents the programme and outcomes of Dagstuhl Seminar 12471 "SAT Interactions". The seminar brought together researchers from different areas from theoretical computer science as well as the area of SAT solvers. A key objective of the seminar has been to initiate or consolidate discussions among the different groups for a fresh attack on one of the most important problems in theoretical computer science and mathematics.
Subject Classification
Keywords
- satisfiability problem
- computational complexity
- P-NP question
- proof complexity
- combinatorics
- SAT-solvers
- quantified Boolean formulas
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads