Algorithms for structured matrix-vector product of optimal bilinear complexity.
Ke YeLek-Heng LimPublished in: ITW (2016)
Keyphrases
- worst case
- computational complexity
- computationally efficient
- dynamic programming
- computational cost
- linear algebra
- space complexity
- learning algorithm
- data structure
- optimization problems
- exhaustive search
- matrix multiplication
- data sets
- complexity measures
- rows and columns
- complexity analysis
- memory requirements
- orders of magnitude
- theoretical analysis
- np hard
- objective function
- real world