Olaf Beyersdorff, Joshua Blinkhorn. Genuine Lower Bounds for QBF Expansion. In Rolf Niedermeier, Brigitte Vallée, editors, 35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France. Volume 96 of LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2018. [doi]
@inproceedings{BeyersdorffB18,
title = {Genuine Lower Bounds for QBF Expansion},
author = {Olaf Beyersdorff and Joshua Blinkhorn},
year = {2018},
doi = {10.4230/LIPIcs.STACS.2018.12},
url = {http://dx.doi.org/10.4230/LIPIcs.STACS.2018.12},
researchr = {https://researchr.org/publication/BeyersdorffB18},
cites = {0},
citedby = {0},
booktitle = {35th Symposium on Theoretical Aspects of Computer Science, STACS 2018, February 28 to March 3, 2018, Caen, France},
editor = {Rolf Niedermeier and Brigitte Vallée},
volume = {96},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-95977-062-0},
}