Is Coppersmith-Winograd algorithm better than Strassen’s algorithm

is-coppersmith-winograd-algorithm-better-than-strassens-algorithm

Is Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity?

A. True

B. False

This question was posed to me in my homework.

The question is from Recursion topic in section Recursion of Data Structures & Algorithms II

Correct option is A. True

Explanation: Since The Coppersmith-Winograd algorithm multiplies the matrices in O(n^2.37) time. The time complexity of recursive multiplication of two square matrices by Strassen’s Method is found to be O(n^2.80). Therefore, Coppersmith-Winograd algorithm better than Strassen’s algorithm in terms of time complexity.