Random CNFs are Hard for Cutting Planes

The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics; it is used as a testbench for satisfiability algorithms, and average-case hardness over this distribution has also been linked to hardness of approximation via Feige's hypothesis. We prove that any Cutting Planes refutation for random k-SAT requires exponential size, for k that is logarithmic in the number of variables, in the (interesting) regime where the number of clauses guarantees that the formula is unsatisfiable with high probability.

[1]  Stasys Jukna,et al.  Boolean Function Complexity Advances and Frontiers , 2012, Bull. EATCS.

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

[3]  Eli Ben-Sasson,et al.  Random Cnf’s are Hard for the Polynomial Calculus , 2010, computational complexity.

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

[5]  Albert Atserias,et al.  A combinatorial characterization of resolution width , 2003, 18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings..

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

[7]  Ran Raz,et al.  Lower bounds for cutting planes proofs with small coefficients , 1995, STOC '95.

[8]  Allan Sly,et al.  Proof of the Satisfiability Conjecture for Large k , 2014, STOC.

[9]  Michael E. Saks,et al.  On the complexity of unsatisfiability proofs for random k-CNF formulas , 1998, STOC '98.

[10]  A. Razborov.  Unprovability of lower bounds on circuit size in certain fragments of bounded arithmetic , 1995 .

[11]  References , 1971 .

[12]  Endre Szemerédi,et al.  Many hard examples for resolution , 1988, JACM.

[13]  Christer Berg,et al.  Symmetric approximation arguments for monotone lower bounds without sunflowers , 1999, computational complexity.

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

[15]  Noga Alon,et al.  The monotone circuit complexity of boolean functions , 1987, Comb..

[16]  Uriel Feige,et al.  Resolution lower bounds for the weak pigeon hole principle , 2002, Proceedings 17th IEEE Annual Conference on Computational Complexity.

[17]  Michael Alekhnovich.  Lower Bounds for k-DNF Resolution on Random 3-CNFs , 2005, STOC '05.

[18]  Pavel Pudlák,et al.  Random Formulas, Monotone Circuits, and Interpolation , 2017, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

[19]  Guy Kindler,et al.  On the optimality of semidefinite relaxations for average-case and generalized constraint satisfaction , 2013, ITCS '13.

[20]  Pavel Pudlák,et al.  A note on monotone real circuits , 2018, Inf. Process. Lett..

[21]  Yuval Filmus,et al.  Semantic Versus Syntactic Cutting Planes , 2016, STACS.

[22]  Dmitry Sokolov.  Dag-Like Communication and Its Applications , 2016, CSR.

[23]  Czech Republickrajicek.  Interpolation Theorems, Lower Bounds for Proof Systems, and Independence Results for Bounded Arithmetic , 2007 .

[24]  Eli Ben-Sasson,et al.  Random Cnf’s are Hard for the Polynomial Calculus , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).