Evaluating the computational complexity of two algorithms
3 vues (au cours des 30 derniers jours)
Afficher commentaires plus anciens
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?
0 commentaires
Réponses (1)
Dinesh Yadav
le 3 Juin 2020
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 commentaires
Voir également
Catégories
En savoir plus sur Problem-Based Optimization Setup dans Help Center et File Exchange
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!