Running Time Comparison and Applications of Multiplying $\mathbf{2} \times \mathbf{2}$ Matrices Using the Strassen Algorithm.
Shanzhen GaoOlumide MalomoEphrem EyobWeizheng GaoPublished in: CSCI (2022)
Keyphrases
- learning algorithm
- high accuracy
- experimental evaluation
- computational complexity
- simulated annealing
- k means
- dynamic programming
- computational cost
- worst case
- theoretical analysis
- times faster
- significant improvement
- cost function
- optimization algorithm
- matching algorithm
- convergence rate
- sparse matrix
- nonnegative matrix factorization
- detection algorithm
- preprocessing
- search algorithm
- optimal solution