Evaluating the computational complexity of two algorithms
Afficher commentaires plus anciens
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?
Réponses (1)
Dinesh Yadav
le 3 Juin 2020
0 votes
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(
).
).Catégories
En savoir plus sur Direct Search dans Centre d'aide et File Exchange
le 1 Juin 2020
le 3 Juin 2020
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
