In this project, we explore the performance of two matrix multiplication algorithms, Strassen's and Brute Force, along with a hybrid approach that combines the strengths of both. Strassen's algorithm ...

Strassen's algorithm is a divide and conquer algorithm for multiplying two square matrices of dimension n by n where n is a power of 2. The runtime is O(n^log_2(7)) which beats the naive O(n^3) ...

Abstract: Strassen's algorithm has fascinated as a popular recursive algorithm for square matrix multiplication with the complexity of O(n 2.807) in many scientific applications since 1969. However, ...