@Article{beyersdorff_et_al:DagRep.6.9.74,
  author =	{Beyersdorff, Olaf and Creignou, Nadia and Egly, Uwe and Vollmer, Heribert},
  title =	{{SAT and Interactions (Dagstuhl Seminar 16381)}},
  pages =	{74--93},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2017},
  volume =	{6},
  number =	{9},
  editor =	{Beyersdorff, Olaf and Creignou, Nadia and Egly, Uwe and Vollmer, Heribert},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagRep.6.9.74},
  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}
}