Evaluating the computational complexity of two algorithms

1 view (last 30 days)
Gokul PN
Gokul PN on 1 Jun 2020
Answered: Dinesh Yadav on 3 Jun 2020
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?

Sign in to answer this question.

Answers (1)

Dinesh Yadav
Dinesh Yadav on 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().

Categories

Find more on Linear Programming and Mixed-Integer Linear Programming in Help Center and File Exchange

Tags

Community Treasure Hunt

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

Start Hunting!