One-Way Communication Complexity and the Ne[c-caron]iporuk Lower Bound on Formula Size.
Hartmut KlauckPublished in: SIAM J. Comput. (2007)
Keyphrases
- lower bound
- worst case
- upper bound
- space complexity
- computational complexity
- branch and bound algorithm
- np hard
- memory requirements
- optimal solution
- computational cost
- information sharing
- lower and upper bounds
- network size
- special case
- average case complexity
- worst case time complexity
- polynomial approximation
- exponential size
- branch and bound
- complexity analysis
- lower bounding
- polynomial size
- communication systems
- knapsack problem
- sensor networks