Evaluating the computational complexity of two algorithms

1 次查看（过去 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 中查找有关 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!

Translated by