Evaluating the computational complexity of two algorithms

조회 수: 6 (최근 30일)
Gokul PN
Gokul PN 2020년 6월 1일
답변: Dinesh Yadav 2020년 6월 3일
How can i compare the computational complexity of two algorithms in terms of matrix multiplications involved in it?

답변 (1개)

Dinesh Yadav
Dinesh Yadav 2020년 6월 3일
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().

카테고리

Help CenterFile Exchange에서 Problem-Based Optimization Setup에 대해 자세히 알아보기

Community Treasure Hunt

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

Start Hunting!

Translated by