The disjointness problem - where Alice and Bob are given two subsets of \{1, \dots, n\} and they have to check if their sets intersect - is a central problem in the world of communication complexity. While both deterministic and randomized communication complexities for this problem are known to be ... more >>>