Coppersmith–Winograd algorithm - Square Matrix Multiplication
Coppersmith–Winograd algorithm was the asymptotically fastest known algorithmfor square matrix multiplication until 2010. It can multiply two
matrices in 
time. This is an improvement over the naïve 
time algorithm and the 
time Strassen algorithm.
The Coppersmith–Winograd algorithm is frequently used as a building block in other algorithms to prove theoretical time bounds. However, unlike the Strassen algorithm, it is not used in practice because it only provides an advantage for matrices so large that they cannot be processed by modern hardware.
http://theory.stanford.edu/~virgi/matrixmult-f.pdf
http://bioinfo.ict.ac.cn/~dbu/AlgorithmCourses/Lectures/MAndersonSBarman2009.pdf
Coppersmith–Winograd algorithm was the asymptotically fastest known algorithmfor square matrix multiplication until 2010. It can multiply two
matrices in time. This is an improvement over the naïve time algorithm and the time Strassen algorithm. The Coppersmith–Winograd algorithm is frequently used as a building block in other algorithms to prove theoretical time bounds. However, unlike the Strassen algorithm, it is not used in practice because it only provides an advantage for matrices so large that they cannot be processed by modern hardware.
http://theory.stanford.edu/~virgi/matrixmult-f.pdf
http://bioinfo.ict.ac.cn/~dbu/AlgorithmCourses/Lectures/MAndersonSBarman2009.pdf
