Evaluating the computational complexity of two algorithms

1 Ansicht (letzte 30 Tage)
Gokul PN
Gokul PN am 1 Jun. 2020
Beantwortet: Dinesh Yadav am 3 Jun. 2020
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?

Melden Sie sich an, um diese Frage zu beantworten.

Antworten (1)

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

Kategorien

Mehr zu Linear Programming and Mixed-Integer Linear Programming finden Sie in Help Center und File Exchange

Tags

Community Treasure Hunt

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

Start Hunting!

Translated by