Direct Product Theorems for Communication Complexity via Subdistribution Bounds.
Rahul JainHartmut KlauckAshwin NayakPublished in: Electron. Colloquium Comput. Complex. (2007)
Keyphrases
- worst case
- lower bound
- upper bound
- computational complexity
- communication systems
- life cycle
- computer networks
- communication overhead
- communication networks
- information exchange
- upper and lower bounds
- complexity bounds
- database
- communication protocol
- product design
- complexity analysis
- space complexity
- decision problems
- computational cost
- genetic algorithm