Which algorithm for matrix multiplication improves upon the standard O(n^3) complexity by using a divide-and-conquer approach with only seven multiplications?

Strassen's Algorithm

Strassen's algorithm reduces the number of recursive multiplications from 8 to 7, resulting in a complexity of approximately O(n^2.81). It was the first algorithm to prove that matrix multiplication could be done faster than O(n^3).