A direct sum theorem in communication complexity via message compression

What this record says

We prove lower bounds for the direct sum problem for two-party bounded error randomised multiple-round communication protocols. Our proofs use

CATALOG · The abstract is indexed.