Lower bounds in communication complexity based on factorization norms.
Nati LinialAdi ShraibmanPublished in: Random Struct. Algorithms (2009)
Keyphrases
- lower bound
- worst case
- upper bound
- lower and upper bounds
- objective function
- communication systems
- branch and bound algorithm
- branch and bound
- complexity measures
- matrix factorization
- information sharing
- online learning
- memory requirements
- decision problems
- learning theory
- np hard
- upper and lower bounds
- quadratic assignment problem
- optimal solution