Lower bounds for depth 4 formulas computing iterated matrix multiplication.
Hervé FournierNutan LimayeGuillaume MalodSrikanth SrinivasanPublished in: STOC (2014)
Keyphrases
- lower bound
- matrix multiplication
- upper bound
- objective function
- branch and bound algorithm
- distributed memory
- optimal solution
- depth map
- branch and bound
- matrix factorization
- lower and upper bounds
- message passing
- worst case
- missing data
- vc dimension
- tree decompositions
- image processing
- software engineering
- dynamic programming
- np hard
- preprocessing
- computational complexity
- three dimensional