Strongly exponential lower bounds for monotone computation

For a universal constant α > 0 we prove size lower bounds of 2α(n) for an explicit function in monotone NP in the following models of computation: monotone formulas, monotone switching networks, monotone span programs, and monotone comparator circuits, where n is the number of variables of the underlying function. Our lower bounds improve on the best previous bounds in each of these models, and are the best possible for any function up to constant factors in the exponent. Moreover, we give one unified proof that is short and fairly elementary.

[1]  Benjamin Rossman,et al.  Correlation Bounds Against Monotone NC^1 , 2015, CCC.

[2]  Arkadev Chattopadhyay,et al.  Multiparty Communication Complexity of Disjointness , 2008, Electron. Colloquium Comput. Complex..

[3]  T. Sanders,et al.  Analysis of Boolean Functions , 2012, ArXiv.

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

[5]  HierarchyRan Raz,et al.  Separation of the Monotone NC , 1999 .

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

[7]  Nikhil Srivastava,et al.  Interlacing Families IV: Bipartite Ramanujan Graphs of All Sizes , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

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

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

[10]  Ran Raz,et al.  Higher lower bounds on monotone size , 2000, STOC '00.

[11]  Claude E. Shannon,et al.  The synthesis of two-terminal switching circuits , 1949, Bell Syst. Tech. J..

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

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

[14]  Ran Raz,et al.  Separation of the Monotone NC Hierarchy , 1999, Comb..

[15]  Alexander A. Sherstov.  Communication Lower Bounds Using Dual Polynomials , 2008, Bull. EATCS.

[16]  Toniann Pitassi,et al.  Deterministic Communication vs. Partition Number , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[17]  Mika Göös,et al.  Lower Bounds for Clique vs. Independent Set , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

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

[19]  Alexander A. Razborov,et al.  Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..

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

[21]  Alexander A. Sherstov.  The Pattern Matrix Method , 2009, SIAM J. Comput..

[22]  Anna Gál,et al.  Lower bounds for monotone span programs , 1994, Proceedings of IEEE 36th Annual Foundations of Computer Science.

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

[24]  Nikhil Srivastava,et al.  Interlacing Families I: Bipartite Ramanujan Graphs of All Degrees , 2013, 2013 IEEE 54th Annual Symposium on Foundations of Computer Science.

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

[26]  Allan Borodin,et al.  On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..

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

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

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

[30]  Aaron Potechin,et al.  Bounds on Monotone Switching Networks for Directed Connectivity , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[31]  Prasad Raghavendra,et al.  Lower Bounds on the Size of Semidefinite Programming Relaxations , 2014, STOC.

[32]  Aaron Potechin,et al.  Tight bounds for monotone switching networks via fourier analysis , 2012, STOC '12.