Strassen’s Algorithm for Matrix multiplication

Strassen’s Algorithm for Matrix multiplication is a recursive algorithm for multiplying n*n matrices in O(n^lg(7)) ie O(n^2.81) time. It outperforms the naive O(n^3) matrix multiplication algorithm. Naive Matrix-Multiplication (A, B) Pseudocode 1. n = Length[A] 2. C = n x n matrix 3. for i = 1 to n 4. do […]