A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
Joshua BrodyAmit ChakrabartiPublished in: CoRR (2009)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- worst case
- objective function
- lower and upper bounds
- np hard
- branch and bound
- sufficiently accurate
- upper and lower bounds
- optimal solution
- distance measure
- communication networks
- communication overhead
- bag of words
- approximation algorithms
- communication cost
- communication systems
- sample complexity
- communication channels
- communication technologies
- multi step
- communication protocol
- data sets