An optimal lower bound on the communication complexity of gap-hamming-distance.

Amit Chakrabarti, Oded Regev

Browse the full STOC paper archive.