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 , and the divide and combine steps together will take time. He needs to determine how many subproblems his algorithm has to create in order to beat Strassen’s algorithm. If his algorithm creates subproblems, then the recurrence for the running time becomes . What is the largest integer value of for which Professor Caesar’s algorithm would be asymptotically faster than Strassen’s algorithm?

Assymptotic running time for Strassen’s algorithm is

Now, when increases, number of subproblems determines the assymptotic running time of the problem and case 1 of master theorem applies. So, in worst case, assymptotic running time of the algortihm will be

Now, for to be smaller than , must be smaller than .

Hence, largest integer value of is .

If you have any question or suggestion or you have found any error in this solution, please leave a comment below.