2026-07-28T00:25:09Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:6911 2024-03-06T10:26:38Z ddc:004 open_access

SAT and Interactions (Dagstuhl Seminar 16381) Beyersdorff, Olaf Creignou, Nadia Egly, Uwe Vollmer, Heribert Combinatorics Computational Complexity P vs. NP Proof Complexity Quantified Boolean formulas SAT-solvers satisfiability problem 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Olaf Beyersdorff and Nadia Creignou and Uwe Egly and Heribert Vollmer 2017 Is Part Of Dagstuhl Reports, Volume 6, Issue 9 (2017) Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/DagRep.6.9.74 urn:nbn:de:0030-drops-69116 https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.9.74 eng https://creativecommons.org/licenses/by/3.0/legalcode