title: Algorithm to beat Strassen's Algorithm
body: <p>Professor Caesar wishes to develop a matrix-multiplication algorithm that is
  asymptotically faster than Strassen’s algorithm. His algorithm will use the divide and-conquer method, dividing each matrix into pieces of size n/4 x n/4, and the divide and combine steps together will take Theta(n^2) time.</p>