Revisiting Space in Proof Complexity: Treewidth and Pathwidth

Moritz M{ü}ller, Stefan Szeider
January 2013
bib DOI

Abstract

Full Citation:

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

Type
Conference Paper
Stefan Szeider
Stefan Szeider
Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.