In this talk, we show a strong XOR lemma for bounded-round
two-player randomized communication. For a function
f:X×Y→{0,1}, the n-fold XOR function f^⊕n:X^n×Y^n→{0,1} maps n
input pairs (x_1,...,x_n), (y_1,...,y_n) to the XOR of the n output
bits f...