Approximability of p → q Matrix Norms: Generalized Krivine Rounding and Hypercontractive Hardness.
Vijay BhattiproluMrinalkanti GhoshVenkatesan GuruswamiEuiwoong LeeMadhur TulsianiPublished in: SODA (2019)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- eigenvalue problems
- computational complexity
- worst case
- singular value decomposition
- eigenvalue decomposition
- special case
- multi agent systems
- information theoretic
- low rank
- rough approximations
- support vector
- linear programming
- multi agent
- linear programming relaxation
- feature space
- rows and columns
- sparse matrix