Super-logarithmic depth lower bounds via direct sum in communication complexity
暂无分享,去创建一个
Ran Raz | Avi Wigderson | Mauricio Karchmer | A. Wigderson | Mauricio Karchmer | R. Raz | M. Karchmer
[1] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[2] Mauricio Karchmer,et al. Communication complexity - a new approach to circuit depth , 1989 .
[3] Mihalis Yannakakis,et al. Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.
[4] Nader H. Bshouty,et al. On the extended direct sum conjecture , 1989, STOC '89.
[5] Avi Wigderson,et al. Composition of the Universal Relation , 1990, Advances In Computational Complexity Theory.
[6] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.
[7] Kurt Mehlhorn,et al. Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.
[8] Giulia Galbiati. M. J. Fischer: On the Complexity of 2-Output Boolean Networks , 1981, Theor. Comput. Sci..
[9] William M. Kantor,et al. On incidence matrices of finite projective and affine spaces , 1972 .
[10] V. M. Khrapchenko. Method of determining lower bounds for the complexity of P-schemes , 1971 .
[11] Alfred V. Aho,et al. On notions of information transfer in VLSI circuits , 1983, STOC.
[12] Alexander A. Razborov,et al. Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..