@InProceedings{beyersdorff_et_al:LIPIcs.STACS.2016.15,
author = {Beyersdorff, Olaf and Chew, Leroy and Mahajan, Meena and Shukla, Anil},
title = {{Are Short Proofs Narrow? QBF Resolution is not Simple}},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
pages = {15:1--15:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-001-9},
ISSN = {1868-8969},
year = {2016},
volume = {47},
editor = {Ollinger, Nicolas and Vollmer, Heribert},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2016.15},
URN = {urn:nbn:de:0030-drops-57164},
doi = {10.4230/LIPIcs.STACS.2016.15},
annote = {Keywords: proof complexity, QBF, resolution, lower bound techniques, simulations}
}