Evaluating the computational complexity of two algorithms

1 visualización (últimos 30 días)
Gokul PN
Gokul PN el 1 de Jun. de 2020
Respondida: Dinesh Yadav el 3 de Jun. de 2020
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?

Iniciar sesión para responder a esta pregunta.

Respuestas (1)

Dinesh Yadav
Dinesh Yadav el 3 de Jun. de 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().

Categorías

Más información sobre Linear Programming and Mixed-Integer Linear Programming en Help Center y File Exchange.

Etiquetas

Community Treasure Hunt

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

Start Hunting!

Translated by