Evaluating the computational complexity of two algorithms
显示 更早的评论
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?
回答（1 个）
Dinesh Yadav
2020-6-3
0 个投票
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(
).
).类别
在 帮助中心 和 File Exchange 中查找有关 Direct Search 的更多信息
2020-6-3
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
