The Space Complexity of Cutting Planes Refutations

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]

Abstract

Abstract is missing.