A Depth-Five Lower Bound for Iterated Matrix Multiplication.
Suman K. BeraAmit ChakrabartiPublished in: Computational Complexity Conference (2015)
Keyphrases
- matrix multiplication
- lower bound
- upper bound
- message passing
- branch and bound algorithm
- branch and bound
- optimal solution
- np hard
- objective function
- distributed memory
- depth information
- matrix factorization
- depth map
- lower and upper bounds
- worst case
- linear programming relaxation
- higher order
- recommender systems
- similarity measure