Olaf Beyersdorff, Leroy Chew, Meena Mahajan, Anil Shukla. Are Short Proofs Narrow? QBF Resolution is not Simple. In Nicolas Ollinger, Heribert Vollmer, editors, 33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France. Volume 47 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2016. [doi]
@inproceedings{BeyersdorffCMS16,
title = {Are Short Proofs Narrow? QBF Resolution is not Simple},
author = {Olaf Beyersdorff and Leroy Chew and Meena Mahajan and Anil Shukla},
year = {2016},
doi = {10.4230/LIPIcs.STACS.2016.15},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2016.15},
researchr = {https://researchr.org/publication/BeyersdorffCMS16},
cites = {0},
citedby = {0},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, STACS 2016, February 17-20, 2016, Orléans, France},
editor = {Nicolas Ollinger and Heribert Vollmer},
volume = {47},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-001-9},
}