Representations of Monotone Boolean Functions by Linear Programs

We introduce the notion of monotone linear programming circuits (MLP circuits), a model of computation for partial Boolean functions. Using this model, we prove the following results.1 (1) MLP circuits are superpolynomially stronger than monotone Boolean circuits. (2) MLP circuits are exponentially stronger than monotone span programs over the reals. (3) MLP circuits can be used to provide monotone feasibility interpolation theorems for Lovász-Schrijver proof systems and for mixed Lovász-Schrijver proof systems. (4) The Lovász-Schrijver proof system cannot be polynomially simulated by the cutting planes proof system. Finally, we establish connections between the problem of proving lower bounds for the size of MLP circuits and the field of extension complexity of polytopes.

[1]  Michel X. Goemans,et al.  Smallest compact formulation for the permutahedron , 2015, Math. Program..

[2]  Anna Gál.  A characterization of span program size and improved lower bounds for monotone span programs , 1998, STOC '98.

[3]  Jan Krajícek,et al.  Lower bounds on Hilbert's Nullstellensatz and propositional proofs , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[4]  Pavel Pudlák,et al.  A note on monotone complexity and the rank of matrices , 2003, Inf. Process. Lett..

[5]  Mark Braverman,et al.  An information complexity approach to extended formulations , 2013, STOC '13.

[6]  Toniann Pitassi,et al.  Exponential Lower Bounds for Monotone Span Programs , 2016, 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS).

[7]  Toniann Pitassi,et al.  Exponential Lower Bounds and Integrality Gaps for Tree-Like Lovász-Schrijver Procedures , 2009, SIAM J. Comput..

[8]  Ran Raz,et al.  Monotone circuits for matching require linear depth , 1990, STOC '90.

[9]  Thomas Rothvoß,et al.  The matching polytope has exponential extension complexity , 2013, STOC.

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

[11]  Dima Grigoriev,et al.  Complexity of Semi-algebraic Proofs , 2002, STACS.

[12]  Jan Krajícek.  Interpolation and Approximate Semantic Derivations , 2002, Math. Log. Q..

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

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

[15]  Alexander A. Razborov,et al.  Proof Complexity and Beyond , 2018 .

[16]  Xudong Fu,et al.  Lower bounds on sizes of cutting plane proofs for modular coloring principles , 1996, Proof Complexity and Feasible Arithmetics.

[17]  Samuel Fiorini,et al.  Approximation Limits of Linear Programs (Beyond Hierarchies) , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[18]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

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

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

[21]  Alexander A. Razborov.  Guest Column: Proof Complexity and Beyond , 2016, SIGA.

[22]  Pavel Pudlák,et al.  Representations of Monotone Boolean Functions by Linear Programs , 2019, CCC.

[23]  Avi Wigderson,et al.  Superpolynomial Lower Bounds for Monotone Span Programs , 1996, Comb..

[24]  Dima Grigoriev,et al.  Linear lower bound on degrees of Positivstellensatz calculus proofs for the parity , 2001, Theor. Comput. Sci..

[25]  Michael Alekhnovich,et al.  Satisfiability, Branch-Width and Tseitin tautologies , 2011, computational complexity.

[26]  Samuel R. Buss,et al.  Good degree bounds on Nullstellensatz refutations of the induction principle , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).

[27]  Arist Kojevnikov,et al.  Lower Bounds of Static Lovász-Schrijver Calculus Proofs for Tseitin Tautologies , 2006, ICALP.

[28]  A. Razborov.  Lower bounds on monotone complexity of the logical permanent , 1985 .

[29]  Jirí Sgall,et al.  Algebraic models of computation and interpolation for algebraic proof systems , 1996, Proof Complexity and Feasible Arithmetics.

[30]  Alexander Schrijver,et al.  Cones of Matrices and Set-Functions and 0-1 Optimization , 1991, SIAM J. Optim..

[31]  Avi Wigderson,et al.  On span programs , 1993, [1993] Proceedings of the Eigth Annual Structure in Complexity Theory Conference.

[32]  Russell Impagliazzo,et al.  Lower bounds for the polynomial calculus and the Gröbner basis algorithm , 1999, computational complexity.

[33]  Hans Raj Tiwary,et al.  Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.