Random Formulas, Monotone Circuits, and Interpolation

We prove new lower bounds on the sizes of proofs in the Cutting Plane proof system, using a concept that we call unsatisfiability certificate. This approach is, essentially, equivalent to the well-known feasible interpolation method, but is applicable to CNF formulas that do not seem suitable for interpolation. Specifically, we prove exponential lower bounds for random k-CNFs, where k is the logarithm of the number of variables, and for the Weak Bit Pigeon Hole Principle. Furthermore, we prove a monotone variant of a hypothesis of Feige [12]. We give a superpolynomial lower bound on monotone real circuits that approximately decide the satisfiability of k-CNFs, where k = ω(1). For k ≈ logn, the lower bound is exponential.

[1]  Alexander A. Razborov,et al.  On the Distributional Complexity of Disjointness , 1992, Theor. Comput. Sci..

[2]  Michael Alekhnovich,et al.  Lower bounds for polynomial calculus: non-binomial case , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

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

[4]  Stasys Jukna.  Finite limits and monotone computations: the lower bounds criterion , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.

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

[6]  E. Friedgut,et al.  Sharp thresholds of graph properties, and the -sat problem , 1999 .

[7]  Uriel Feige,et al.  Relations between average case complexity and approximation complexity , 2002, STOC '02.

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

[9]  Ralph E. Gomory,et al.  Outline of an Algorithm for Integer Solutions to Linear Programs and An Algorithm for the Mixed Integer Problem , 2010, 50 Years of Integer Programming.

[10]  Alexander A. Sherstov.  The multiparty communication complexity of set disjointness , 2012, STOC '12.

[11]  Amin Coja-Oghlan,et al.  The asymptotic k-SAT threshold , 2014, STOC.

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

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

[14]  Troy Lee,et al.  Disjointness Is Hard in the Multi-party Number-on-the-Forehead Model , 2008, Computational Complexity Conference.

[15]  Jan Krajícek,et al.  Interpolation theorems, lower bounds for proof systems, and independence results for bounded arithmetic , 1997, Journal of Symbolic Logic.

[16]  Toniann Pitassi,et al.  Random CNFs are Hard for Cutting Planes , 2017, Electron. Colloquium Comput. Complex..

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

[18]  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.

[19]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

[20]  Arnold Rosenbloom,et al.  Monotone Real Circuits are More Powerful than Monotone Boolean Circuits , 1997, Inf. Process. Lett..

[21]  Armin Haken,et al.  The Intractability of Resolution , 1985, Theor. Comput. Sci..

[22]  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).

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

[24]  Troy Lee,et al.  Disjointness is Hard in the Multiparty Number-on-the-Forehead Model , 2007, 2008 23rd Annual IEEE Conference on Computational Complexity.

[25]  Alexander A. Razborov,et al.  Lower bounds for the polynomial calculus , 1998, computational complexity.

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

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

[28]  L. Goddard.  Information Theory , 1962, Nature.

[29]  Avi Wigderson,et al.  Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.

[30]  Toniann Pitassi,et al.  Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity , 2005, ICALP.

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