Evaluating the computational complexity of two algorithms
Mostrar comentarios más antiguos
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?
Respuestas (1)
Dinesh Yadav
el 3 de Jun. de 2020
0 votos
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(
).
).Categorías
Más información sobre Direct Search en Centro de ayuda y File Exchange.
el 1 de Jun. de 2020
el 3 de Jun. de 2020
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
