The Space Complexity of Cutting Planes Refutations - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

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]

This author has not been identified. Look up 'Nicola Galesi' in GoogleThis author has not been identified. Look up 'Pavel Pudlák' in GoogleThis author has not been identified. Look up 'Neil Thapen' in Google

runs on WebDSL