Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/DagRep.6.9.74
URN: urn:nbn:de:0030-drops-69116
URL: https://drops.dagstuhl.de/opus/volltexte/2017/6911/
Beyersdorff, Olaf ; Creignou, Nadia ; Egly, Uwe ; Vollmer, Heribert
Weitere Beteiligte (Hrsg. etc.): Olaf Beyersdorff and Nadia Creignou and Uwe Egly and Heribert Vollmer
SAT and Interactions (Dagstuhl Seminar 16381)
| pdf-format: |
|
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.
BibTeX - Entry
@Article{beyersdorff_et_al:DR:2017:6911,
author = {Olaf Beyersdorff and Nadia Creignou and Uwe Egly and Heribert Vollmer},
title = {{SAT and Interactions (Dagstuhl Seminar 16381)}},
pages = {74--93},
journal = {Dagstuhl Reports},
ISSN = {2192-5283},
year = {2017},
volume = {6},
number = {9},
editor = {Olaf Beyersdorff and Nadia Creignou and Uwe Egly and Heribert Vollmer},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/6911},
URN = {urn:nbn:de:0030-drops-69116},
doi = {10.4230/DagRep.6.9.74},
annote = {Keywords: Combinatorics, Computational Complexity, P vs. NP, Proof Complexity, Quantified Boolean formulas, SAT-solvers, satisfiability problem}
}
| Keywords: | Combinatorics, Computational Complexity, P vs. NP, Proof Complexity, Quantified Boolean formulas, SAT-solvers, satisfiability problem | |
| Seminar: | Dagstuhl Reports, Volume 6, Issue 9 | |
| Issue date: | 2017 | |
| Date of publication: | 13.01.2017 |
