Approximation norms and duality for communication complexity lower bounds.
Troy LeeAdi ShraibmanPublished in: Computational Complexity of Discrete Problems (2008)
Keyphrases
- lower bound
- worst case
- approximation error
- upper bound
- approximation guarantees
- objective function
- space complexity
- approximation algorithms
- np hard
- computational complexity
- linear programming
- bayes error rate
- average case complexity
- error bounds
- communication channels
- min sum
- constant factor
- complexity measures
- multi agent systems
- polynomial approximation
- expected error
- social networks
- linear programming relaxation
- average case
- communication networks
- branch and bound
- closed form