A Direct Product Theorem for the Two-Party Bounded-Round Public-Coin Communication Complexity.

Rahul Jain Attila Pereszlényi Penghui Yao

Published in: FOCS (2012)

Keyphrases

worst case
computational complexity
communication protocol
data sets
communication patterns
computational cost
np complete
information exchange
space complexity
complexity analysis
credit card
communication overhead