Nicola Galesi, Pavel Pudlák, Neil Thapen. The Space Complexity of Cutting Planes Refutations. In David Zuckerman, editor, 30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA. Volume 33 of LIPIcs, pages 433-447, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2015. [doi]
@inproceedings{GalesiPT15,
title = {The Space Complexity of Cutting Planes Refutations},
author = {Nicola Galesi and Pavel Pudlák and Neil Thapen},
year = {2015},
doi = {10.4230/LIPIcs.CCC.2015.433},
url = {http://dx.doi.org/10.4230/LIPIcs.CCC.2015.433},
researchr = {https://researchr.org/publication/GalesiPT15},
cites = {0},
citedby = {0},
pages = {433-447},
booktitle = {30th Conference on Computational Complexity, CCC 2015, June 17-19, 2015, Portland, Oregon, USA},
editor = {David Zuckerman},
volume = {33},
series = {LIPIcs},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
isbn = {978-3-939897-81-1},
}