Revisiting Space in Proof Complexity: Treewidth and Pathwidth

Müller, Moritz; Szeider, Stefan

doi:10.1007/978-3-642-40313-2_62

by Moritz Müller, Stefan Szeider

Reference:

Revisiting Space in Proof Complexity: Treewidth and PathwidthMoritz Müller, Stefan SzeiderMathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings (Krishnendu Chatterjee, Jiri Sgall, eds.), volume 8087 of Lecture Notes in Computer Science, pages 704-716, 2013, Springer Verlag.

Bibtex Entry:

@string{lncs="Lecture Notes in Computer Science"}
@string{springer="Springer Verlag"}
@inproceedings{MullerSzeider13,
  author    = {Moritz M{\"{u}}ller and Stefan Szeider},
  title     = {Revisiting Space in Proof Complexity: Treewidth and Pathwidth},
  booktitle = {Mathematical Foundations of Computer Science 2013 -
                  38th International Symposium, {MFCS} 2013,
                  Klosterneuburg, Austria, August 26-30, 2013.
                  Proceedings},
  pages     = {704-716},
  year      = {2013},
  doi       = {10.1007/978-3-642-40313-2_62},
  editor    = {Krishnendu Chatterjee and
               Jiri Sgall},
  series    = LNCS,
  volume    = {8087},
  publisher = Springer,
}