The Probabilistic Communication Complexity of Set Intersection
暂无分享,去创建一个
It is shown that, for inputs of length n, the probabilistic (bounded error) communication complexity of set intersection is $\Theta ( n )$. Since set intersection can be recognized nondeterministic...