Small Resolution Proofs for QBF using Dependency Treewidth (bibtex)
by , ,
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.), 2018, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik.Note: To appear
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},
  note      = "To appear"
}
Powered by bibtexbrowser