Balasubramanian Kalyanasundaram and Georg Schnitger. The probabilistic communication complexity of set intersection (preliminary version). In Proceedings, Structure in 13 Complexity Theory, Second Annual Conference, pages 41--47, Cornell University, Ithca, NY, 16--19 June 1987. IEEE Computer Society Press. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Towards Proving Strong Direct Product Theorems - Shaltiel (2001) (6 citations) (Correct)
....be able to handle one sided discrepancy, that is removing the absolute value from the definition 2. This may require totally di#erent techniques as we are unaware of an algebraic interpretation of one sided discrepancy. Both extension are motivated by the lower bound on the disjointness function [BFS86, KS87, Raz92] which uses a one sided discrepancy in a non uniform probability distribution. The next model on which we may want to prove a strong product assertion by imposing a fairness restriction is communication complexity. It seems that the result of [PRW97] regarding the forest model does not extend to ....
Balasubramanian Kalyanasundaram and Georg Schnitger. The probabilistic communication complexity of set intersection (preliminary version). In Proceedings, Structure in 13 Complexity Theory, Second Annual Conference, pages 41--47, Cornell University, Ithca, NY, 16--19 June 1987. IEEE Computer Society Press.
Classical versus Quantum Communication Complexity - Ta-Shma (1999) (1 citation) (Correct)
.... (f) This method was used to get lower bounds on the probabilistic communication complexity of many functions, including linear lower bounds for the inner product function [Vaz85, CG88] IP (x 1 ; x n ; y 1 ; y n ) L n i=1 x i Delta y i , and the disjointness function [BFS86, KS87, Raz92] 4 A Quadratic Gap Using Black Box Simulations Buhrman, Cleve and Wigderson [BCW98] show a connection between quantum communication complexity and quantum black box computation, and derive a quadratic separation between classical and quantum communication complexity. We start by ....
Balasubramanian Kalyanasundaram and Georg Schnitger. The probabilistic communication complexity of set intersection (preliminary version). In Proceedings, Structure in Complexity Theory, Second Annual Conference, pages 41--47, Cornell University, Ithca, NY, 16--19 June 1987. IEEE Computer Society Press.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC