Small Resolution Proofs for QBF using Dependency Treewidth (bibtex)
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 to March 3, 2018, Caen, France (Rolf Niedermeier, Brigitte Vallée, eds.), volume 96 of LIPIcs, pages 28:1–28:15, 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.
Bibtex Entry:
@inproceedings{DBLP:conf/stacs/EibenGO18,
  author    = {Eduard Eiben and
               Robert Ganian and
               Sebastian Ordyniak},
  title     = {Small Resolution Proofs for {QBF} using Dependency Treewidth},
  booktitle = {35th Symposium on Theoretical Aspects of Computer Science, {STACS}
               2018, February 28 to March 3, 2018, Caen, France},
  pages     = {28:1--28:15},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.STACS.2018.28},
  doi       = {10.4230/LIPIcs.STACS.2018.28},
  editor    = {Rolf Niedermeier and
               Brigitte Vall{\'{e}}e},
  series    = {LIPIcs},
  volume    = {96},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik}
}
Powered by bibtexbrowser