Question

What is the ''time complexity'' of matrix multiplication?

Answer 1

This project investigates the time complexity of different matrix multiplication algorithms. The objectives of the project are:

understand and implement the naive, recursive and strassen algorithms for matrix multiplicationrun experiments to measure the run-time for each algorithm for different sized extrapolate from this data to find crossing over points at which one algorithm becomes more efficient than another..

Answer 2

Explanation:

The fastest known matrix multiplication algorithm is Coppersmith-Winograd algorithm with a complexity of O(n2.3737). Unless the matrix is huge, these algorithms do not result in a vast difference in computation time.