A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences.
Joshua BrodyAmit ChakrabartiPublished in: Computational Complexity Conference (2009)
Keyphrases
- lower bound
- upper bound
- objective function
- optimal solution
- branch and bound
- branch and bound algorithm
- lower bounding
- communication protocol
- upper and lower bounds
- lower and upper bounds
- sufficiently accurate
- information exchange
- communication channels
- communication networks
- distance measure
- communication overhead
- np hard
- data structure
- polynomial approximation
- social networks