Document Open Access Logo

SAT and Interactions (Dagstuhl Seminar 16381)

Authors Olaf Beyersdorff, Nadia Creignou, Uwe Egly, Heribert Vollmer and all authors of the abstracts in this report



PDF
Thumbnail PDF

File

DagRep.6.9.74.pdf
  • Filesize: 7.03 MB
  • 20 pages

Document Identifiers

Author Details

Olaf Beyersdorff
Nadia Creignou
Uwe Egly
Heribert Vollmer
and all authors of the abstracts in this report

Cite AsGet 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.
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)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail