Question: Let U, V ⊆ {0, 1}n and let |U| ∈ O( n3) , and |V | ∈ O (n2). How many independent runs of PDisj are necessary (i.e., how large is the necessary communication complexity) to successfully decide the disjointness problem for U and V with an error probability tending to 0 with growing n? What happens when U, V ∈ Θ(2√n)?