Small Resolution Proofs for QBF using Dependency Treewidth

Eduard Eiben, Robert Ganian, Sebastian Ordyniak
January 2018
PDF bib

Abstract

Full Citation:

Eduard Eiben, Robert Ganian, Sebastian Ordyniak. Small Resolution Proofs for QBF using Dependency Treewidth. 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier and Brigitte Vall' ee), volume 96 of LIPIcs, pages 28:1-28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Type
Conference Paper
Xtract
Robert Ganian
Robert Ganian

Robert Ganian is a Professor at the Algorithms and Complexity Group.