A note on monotone complexity and the rank of matrices

We shall give simpler proofs of some lower bounds on monotone computations. We describe a simple condition on combinatorial structures, such that the rank of the matrix associated with these structures gives lower bounds on monotone span program size and monotone formula size. We also prove an upper bound on the rank of the corresponding matrices, and show that such structures can be constructed from self-avoiding families. As a corollary, we obtain an upper bound on the size of self-avoiding families, which solves a problem posed by Babai and Gal [Combinatorica 19 (3) (1999) 301-319].

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

[2]  A. Selman.  Structure in Complexity Theory , 1986, Lecture Notes in Computer Science.

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

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

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

[6]  Anna Gál,et al.  Lower bounds for monotone span programs , 2005, computational complexity.

[7]  Avi Wigderson,et al.  Monotone Circuits for Connectivity Require Super-Logarithmic Depth , 1990, SIAM J. Discret. Math..

[8]  Alfred V. Aho,et al.  On notions of information transfer in VLSI circuits , 1983, STOC.

[9]  Kurt Mehlhorn,et al.  Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.

[10]  Eyal Kushilevitz,et al.  Communication Complexity , 1997, Adv. Comput..

[11]  Noga Alon,et al.  Simple Construction of Almost k-wise Independent Random Variables , 1992, Random Struct. Algorithms.

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

[13]  Lajos Rónyai,et al.  Extremal bipartite graphs and superpolynomial lower bounds for monotone span programs , 1996, STOC '96.

[14]  Michael E. Saks,et al.  Combinatorial characterization of read-once formulae , 1993, Discret. Math..