Amortized Communication Complexity
暂无分享,去创建一个
[1] Alfred V. Aho,et al. On notions of information transfer in VLSI circuits , 1983, STOC.
[2] Ran Raz,et al. Monotone circuits for matching require linear depth , 1990, STOC '90.
[3] Giulia Galbiati. M. J. Fischer: On the Complexity of 2-Output Boolean Networks , 1981, Theor. Comput. Sci..
[4] Nader H. Bshouty,et al. On the extended direct sum conjecture , 1989, STOC '89.
[5] Noga Alon,et al. Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[6] H. S. WITSENHAUSEN,et al. The zero-error side information problem and chromatic numbers (Corresp.) , 1976, IEEE Trans. Inf. Theory.
[7] Wolfgang J. Paul. Realizing Boolean Functions on Disjoint sets of Variables , 1976, Theor. Comput. Sci..
[8] Alon Orlitsky. Two messages are almost optimal for conveying information , 1990, PODC '90.
[9] Kurt Mehlhorn,et al. Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract) , 1982, STOC '82.
[10] Ilan Newman,et al. Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..
[11] Alexander A. Razborov,et al. Applications of matrix methods to the theory of lower bounds in computational complexity , 1990, Comb..
[12] Avi Wigderson,et al. Monotone circuits for connectivity require super-logarithmic depth , 1990, STOC '88.
[13] Moni Naor,et al. Small-Bias Probability Spaces: Efficient Constructions and Applications , 1993, SIAM J. Comput..