Evaluating the computational complexity of two algorithms

5 ビュー (過去 30 日間)
Gokul PN
Gokul PN 2020 年 6 月 1 日
回答済み: Dinesh Yadav 2020 年 6 月 3 日
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?

サインインしてこの質問に回答する。

回答 (1 件)

Dinesh Yadav
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().

カテゴリ

Help Center および File Exchange で Problem-Based Optimization Setup についてさらに検索

タグ

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by