Martin Thoma

Part II: The Strassen algorithm in Python, Java and C++

This is Part II of my matrix multiplication series. Part I was about simple matrix multiplication algorithms and Part II was about the Strassen algorithm. Part III is about parallel matrix multiplication. The usual matrix multiplication of two $n \times n$ matrices has a time-complexity of $\mathcal{O}(n^3 … Read More »