Matrix Multiplication is one of the most fundamental operation and optimizing it is the key to several optimizations. In general, multiplying two matrices of size N X N takes N^3 operations. Since then, we have come a long way to better and clever matrix multiplication algorithms.



Volker Strassen first published Strassen’s Matrix Multiplication algorithm in 1969. It is the first algorithm to prove that the basic O(n^3) runtime was not optimal .

This is a companion discussion topic for the original entry at http://iq.opengenus.org/strassens-matrix-multiplication-algorithm/

This image captures the beauty of the algorithm: