The space complexity of cutting planes refutations

We study the space complexity of the cutting planes proof system, in which the lines in a proof are integral linear inequalities. We measure the space used by a refutation as the number of linear inequalities that need to be kept on a blackboard while verifying it. We show that any unsatisfiable set of linear inequalities has a cutting planes refutation in space five. This is in contrast to the weaker resolution proof system, for which the analogous space measure has been well-studied and many optimal linear lower bounds are known. Motivated by this result we consider a natural restriction of cutting planes, in which all coefficients have size bounded by a constant. We show that there is a CNF which requires super-constant space to refute in this system. The system nevertheless already has an exponential speed-up over resolution with respect to size, and we additionally show that it is stronger than resolution with respect to space, by constructing constant-space cutting planes proofs, with coefficients bounded by two, of the pigeonhole principle. We also consider variable instance space for cutting planes, where we count the number of instances of variables on the blackboard, and total space, where we count the total number of symbols.

[1]  John N. Hooker,et al.  Generalized resolution for 0–1 linear inequalities , 1992, Annals of Mathematics and Artificial Intelligence.

[2]  Vasek Chvátal,et al.  Edmonds polytopes and a hierarchy of combinatorial problems , 1973, Discret. Math..

[3]  Jakob Nordström,et al.  Pebble Games, Proof Complexity, and Time-Space Trade-offs , 2013, Log. Methods Comput. Sci..

[4]  Jakob Nordström.  A (Biased) Proof Complexity Survey for SAT Practitioners , 2014, SAT.

[5]  Jakob Nordström,et al.  On the virtue of succinct proofs: amplifying communication complexity hardness to time-space trade-offs in proof complexity , 2012, STOC '12.

[6]  William J. Cook.  Cutting-plane proofs in polynomial space , 1990, Math. Program..

[7]  Toniann Pitassi,et al.  Communication lower bounds via critical block sensitivity , 2013, STOC.

[8]  Eli Ben-Sasson,et al.  Space complexity of random formulae in resolution , 2003, Random Struct. Algorithms.

[9]  Ran Raz,et al.  Lower bounds for cutting planes proofs with small coefficients , 1995, Symposium on the Theory of Computing.

[10]  Pavel Pudlák,et al.  Lower bounds for resolution and cutting plane proofs and monotone computations , 1997, Journal of Symbolic Logic.

[11]  Ralph E. Gomory,et al.  An algorithm for integer solutions to linear programs , 1958 .

[12]  Chris Beck,et al.  Some trade-off results for polynomial calculus: extended abstract , 2013, STOC '13.

[13]  Eli Ben-Sasson,et al.  Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions , 2011, ICS.

[14]  Russell Impagliazzo,et al.  Upper and lower bounds for tree-like cutting planes proofs , 1994, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science.

[15]  Michael Alekhnovich,et al.  Space Complexity in Propositional Calculus , 2002, SIAM J. Comput..

[16]  Eli Ben-Sasson,et al.  Short proofs are narrow—resolution made simple , 2001, JACM.

[17]  Innovations in Theoretical Computer Science, ITCS '13, Berkeley, CA, USA, January 9-12, 2013 , 2013, ITCS.

[18]  Peter Clote,et al.  Cutting planes, connectivity, and threshold logic , 1996, Arch. Math. Log..

[19]  Jacobo Torán,et al.  Space Bounds for Resolution , 1999, STACS.

[20]  Sergey I. Nikolenko,et al.  Simulating Cutting Plane Proofs with Restricted Degree of Falsity by Resolution , 2005, SAT.

[21]  William J. Cook,et al.  On the complexity of cutting-plane proofs , 1987, Discret. Appl. Math..

[22]  Neil Thapen,et al.  Total Space in Resolution , 2014, 2014 IEEE 55th Annual Symposium on Foundations of Computer Science.

[23]  Barnaby Martin,et al.  Cutting Planes and the Parameter Cutwidth , 2011, Theory of Computing Systems.

[24]  Stephen A. Cook,et al.  An Exponential Lower Bound for the Size of Monotone Real Circuits , 1999, J. Comput. Syst. Sci..

[25]  Nicola Galesi,et al.  Pseudo-partitions, transversality and locality: a combinatorial characterization for the space measure in algebraic proof systems , 2013, ITCS '13.