Request file

Review/Citation:  GALESI, N., PUDLÁK, Pavel, THAPEN, Neil. The space complexity of cutting planes refutations. In: ZUCKERMAN, D., ed. 30th Conference on Computational Complexity (CCC 2015). Dagstuhl: Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 2015, s. 433-447. Leibniz International Proceedings in Informatics, 33. ISBN 978-3-939897-81-1. ISSN 1868-8969
Requested document:  Pudlak1.pdf - Publisher’s postprint
The requested document is not available in open access mode. But it is possible to ask the author for a copy of the document through the form below. If your application is accepted, you will receive a document by e - mail.