Number of the records: 1
The space complexity of cutting planes refutations
- 1.Galesi, N., Pudlák, P., Thapen, N. 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. Available: doi: 10.4230/LIPIcs.CCC.2015.433.
Number of the records: 1