Evaluating the computational complexity of two algorithms
6 ビュー (過去 30 日間)
古いコメントを表示
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?
0 件のコメント
回答 (1 件)
Dinesh Yadav
2020 年 6 月 3 日
Depends which algorithm you are using for matrix multiplication. For two matrices
Normal Matrix Multiplication - O().
Strassen's Algorithm - O().
Coppersmith-Winograd algorithm - O().
Optimized CW algorithm - O().
0 件のコメント
参考
カテゴリ
Help Center および File Exchange で Linear Programming and Mixed-Integer Linear Programming についてさらに検索
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!