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 
