Fractional covers and communication complexity
暂无分享,去创建一个
Eyal Kushilevitz | Noam Nisan | Mauricio Karchmer | E. Kushilevitz | Mauricio Karchmer | N. Nisan | M. Karchmer
[1] Mauricio Karchmer,et al. Communication complexity - a new approach to circuit depth , 1989 .
[2] J. Spencer. Probabilistic Methods in Combinatorics , 1974 .
[3] T. Feder,et al. Amortized communication complexity , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.
[4] Johan Håstad,et al. A Simple Lower Bound for Monotone Clique Using a Communication Game , 1992, Inf. Process. Lett..
[5] V. M. Khrapchenko. Method of determining lower bounds for the complexity of P-schemes , 1971 .
[6] Alfred V. Aho,et al. On notions of information transfer in VLSI circuits , 1983, STOC.
[7] Ravi B. Boppana,et al. The Complexity of Finite Functions , 1991, Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity.
[8] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.
[9] Leslie G. Valiant,et al. Short Monotone Formulae for the Majority Function , 1984, J. Algorithms.
[10] Kurt Mehlhorn,et al. Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.
[11] Ran Raz,et al. Monotone circuits for matching require linear depth , 1990, STOC '90.
[12] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[13] Alexander A. Razborov,et al. Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..
[14] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..
[15] Martin Fürer. The power of randomness for communication complexity , 1987, STOC '87.