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

Rahul Jain Attila Pereszlényi Penghui Yao

Published in: Algorithmica (2016)

Keyphrases

computational complexity
data acquisition
communication overhead
communication technologies
worst case
information exchange
life cycle
computer networks
communication networks
decision problems
multi party
communication cost
real time
information sharing
information technology
optimal solution
search engine