The Randomized Communication Complexity of Set Disjointness
暂无分享,去创建一个
[1] Bala Kalyanasundaram,et al. The Probabilistic Communication Complexity of Set Intersection , 1992, SIAM J. Discret. Math..
[2] Ziv Bar-Yossef,et al. An information statistics approach to data stream and communication complexity , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..
[3] Peter Frankl,et al. Complexity classes in communication complexity theory , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).
[4] Eyal Kushilevitz,et al. Communication Complexity , 1997, Adv. Comput..
[5] Ilan Newman,et al. Private vs. Common Random Bits in Communication Complexity , 1991, Inf. Process. Lett..
[6] Andrew Chi-Chih Yao,et al. Some complexity questions related to distributive computing(Preliminary Report) , 1979, STOC.
[7] Ran Raz,et al. Direct product results and the GCD problem, in old and new communication models , 1997, STOC '97.
[8] Ran Raz,et al. Monotone circuits for matching require linear depth , 1990, STOC '90.
[9] László Babai,et al. Randomized simultaneous messages: solution of a problem of Yao in communication complexity , 1997, Proceedings of Computational Complexity. Twelfth Annual IEEE Conference.