Lower bound for communication complexity with no public randomness.
Eli Ben-SassonGal MaorPublished in: Electron. Colloquium Comput. Complex. (2015)
Keyphrases
- lower bound
- worst case
- upper bound
- branch and bound algorithm
- lower and upper bounds
- objective function
- optimal solution
- np hard
- branch and bound
- complexity analysis
- information exchange
- computational complexity
- random number
- communication systems
- communication channels
- average case complexity
- genetic algorithm
- sample complexity
- communication cost
- computer networks
- decision problems
- np complete