Small Resolution Proofs for QBF using Dependency Treewidth

Eiben, Eduard; Ganian, Robert; Ordyniak, Sebastian

by Eduard Eiben, Robert Ganian, Sebastian Ordyniak

Reference:

Small Resolution Proofs for QBF using Dependency TreewidthEduard Eiben, Robert Ganian, Sebastian Ordyniak35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28–March 3, 2018, Caen, France (Rolf Neidermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 28:1–28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.

Bibtex Entry:

@string{lipics="LIPIcs"}
@inproceedings{EibenGanianOrdyniak18,
  author    = {Eduard Eiben and 
               Robert Ganian and
               Sebastian Ordyniak},
  editor    = {Rolf Neidermeier and 
               Brigitte Vall{\' e}e},
  title     = {Small Resolution Proofs for {QBF} using Dependency Treewidth},
  booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS} 2018, February 28--March 3, 2018, Caen, France},
  series    = {LIPIcs},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2018},
  keywords  = {xtract},
  volume    = {96},
  pages     = {28:1--28:15},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2018/8513/}
}