Evaluating the computational complexity of two algorithms
Show older comments
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?
Answers (1)
Dinesh Yadav
on 3 Jun 2020
0 votes
Depends which algorithm you are using for matrix multiplication. For two 
matrices
matrices Normal Matrix Multiplication - O(
).
).Strassen's Algorithm - O(
).
).Coppersmith-Winograd algorithm - O(
).
).Optimized CW algorithm - O(
).
).Categories
Find more on Direct Search in Help Center and File Exchange
on 3 Jun 2020
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
