Evaluating the computational complexity of two algorithms

1 visualizzazione (ultimi 30 giorni)
Gokul PN
Gokul PN il 1 Giu 2020
Risposto: Dinesh Yadav il 3 Giu 2020
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?

Accedi per rispondere a questa domanda.

Risposte (1)

Dinesh Yadav
Dinesh Yadav il 3 Giu 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().

Categorie

Scopri di più su Linear Programming and Mixed-Integer Linear Programming in Help Center e File Exchange

Tag

Community Treasure Hunt

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

Start Hunting!

Translated by