Lower Bounds on the Randomized Communication Complexity of Read-Once Functions.
Nikos LeonardosMichael E. SaksPublished in: Comput. Complex. (2010)
Keyphrases
- lower bound
- worst case
- upper bound
- computational complexity
- max sat
- objective function
- np hard
- communication systems
- branch and bound algorithm
- complexity measures
- communication networks
- communication channels
- upper and lower bounds
- communication overhead
- average case complexity
- decision problems
- branch and bound
- learning algorithm
- communication cost
- basis functions
- lower and upper bounds
- computational cost
- randomized algorithm
- optimal solution
- randomized algorithms