Lower bounds on the randomized communication complexity of read-once functions.
Nikos LeonardosMichael E. SaksPublished in: Electron. Colloquium Comput. Complex. (2009)
Keyphrases
- lower bound
- worst case
- upper bound
- max sat
- branch and bound
- complexity measures
- np hard
- communication networks
- objective function
- branch and bound algorithm
- average case complexity
- information sharing
- space complexity
- basis functions
- randomized algorithms
- neural network
- special case
- computational complexity
- social networks