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. MLP circuits are superpolynomially stronger than monotone Boolean circuits. 2. MLP circuits are exponentially stronger than monotone span programs. 3. MLP circuits can be used to provide monotone feasibility interpolation theorems for Lovasz-Schrijver proof systems, and for mixed Lovasz-Schrijver proof systems. 4. The Lovasz-Schrijver proof system cannot be polynomially simulated by the cutting planes proof system. This is the first result showing a separation between these two proof systems. Finally, we discuss connections between the problem of proving lower bounds on the size of MLPs and the problem of proving lower bounds on extended formulations of polytopes.

[1]  Sanjeeb Dash,et al.  Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs , 2005, Math. Oper. Res..

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

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

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

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

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

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

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

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

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

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

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

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

[14]  Alexander Schrijver,et al.  Theory of linear and integer programming , 1986, Wiley-Interscience series in discrete mathematics and optimization.

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

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

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

[18]  P. Pudlák.  Sets and Proofs: On the Complexity of the Propositional Calculus , 1999 .

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

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

[21]  Pavel Pudlák,et al.  Representations of Monotone Boolean Functions by Linear Programs , 2019, ACM Trans. Comput. Theory.

[22]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

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

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

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

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

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

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

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

[30]  Samuel Fiorini,et al.  Approximation Limits of Linear Programs (Beyond Hierarchies) , 2015, Math. Oper. Res..

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

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

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

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

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

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