Super-logarithmic depth lower bounds via the direct sum in communication complexity

Is it easier to solve two communication problems together than separately? This question is related to the complexity of the composition of boolean functions. Based on this relationship, an approach to separatingNC1 fromP is outlined. Furthermore, it is shown that the approach provides a new proof of the separation of monotoneNC1 from monotoneP.

[1]  Avi Wigderson,et al.  Composition of the Universal Relation , 1990, Advances In Computational Complexity Theory.

[2]  Nader H. Bshouty,et al.  On the extended direct sum conjecture , 1989, STOC '89.

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

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

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

[6]  Ran Raz,et al.  Probabilistic communication complexity of Boolean relations , 1989, 30th Annual Symposium on Foundations of Computer Science.

[7]  Moni Naor,et al.  Amortized Communication Complexity , 1995, SIAM J. Comput..

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

[9]  Andrew Chi-Chih Yao,et al.  Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.

[10]  William M. Kantor,et al.  On incidence matrices of finite projective and affine spaces , 1972 .

[11]  Russell Impagliazzo,et al.  Communication complexity towards lower bounds on circuit depth , 2001, computational complexity.

[12]  Eyal Kushilevitz,et al.  Fractional covers and communication complexity , 1992, [1992] Proceedings of the Seventh Annual Structure in Complexity Theory Conference.

[13]  V. M. Khrapchenko.  Method of determining lower bounds for the complexity of P-schemes , 1971 .

[14]  Giulia Galbiati.  M. J. Fischer: On the Complexity of 2-Output Boolean Networks , 1981, Theor. Comput. Sci..

[15]  Mauricio Karchmer,et al.  Communication complexity - a new approach to circuit depth , 1989 .

[16]  N. S. Barnett,et al.  Private communication , 1969 .

[17]  Ran Raz,et al.  Super-logarithmic depth lower bounds via direct sum in communication complexity , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

[18]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.