DagRep.6.9.74.pdf
- Filesize: 7.03 MB
- 20 pages
Document
SAT and Interactions (Dagstuhl Seminar 16381)
Authors and all authors of the abstracts in this report
-
Part of:
Issue:
Dagstuhl Reports, Volume 6, Issue 9
Volume: Dagstuhl Reports, Volume 6
Journal: Dagstuhl Reports (DagRep) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2017-01-13
Cite As Get BibTex
Olaf Beyersdorff, Nadia Creignou, Uwe Egly, and Heribert Vollmer. SAT and Interactions (Dagstuhl Seminar 16381). In Dagstuhl Reports, Volume 6, Issue 9, pp. 74-93, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/DagRep.6.9.74
Abstract
This report documents the programme and outcomes of Dagstuhl Seminar 16381 "SAT and Interactions". The seminar brought together researchers from different areas from theoretical computer science involved with various aspects of satisfiability. 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
- Combinatorics
- Computational Complexity
- P vs. NP
- Proof Complexity
- Quantified Boolean formulas
- SAT-solvers
- satisfiability problem
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads