The total number of multiplications required to multiply two n×n matrices using Strassen's algorithm, and its amortized time complexity, are respectively:

Strassen’s 7 products (for 2×2):   M1 = (a+d)(e+h)   M2 = (c+d)(e)   M3 = (a)(f−h)   M4 = (d)(g−e)   M5 = (a+b)(h)   M6 = (c−a)(e+f)   M7 = (b−d)(g+h)   Result matrix:   C11 = M1+M4−M5+M7   C12 = M3+M5   C21 = M2+M4   C22 = M1−M2+M3+M6   Multiplications = 7  (saves 1 vs conventional 8)   Additions       = 18 (more than conventional 4) RECURRENCE RELATION:   T(n) = 7 × T(n/2) + O(n²) Applying Master Theorem:   a=7, b=2, f(n)=n²   log_b(a) = log₂7 ≈ 2.807   Since log₂7 > 2 → Case 1 of Master Theorem   T(n) = O(n^log₂7) ≈ O(n^2.807) TOTAL MULTIPLICATIONS for n×n matrix:   At each level of recursion → 7 subproblems   Recursion depth            → log₂n levels   Total multiplications      → 7^(log₂n)   By logarithm identity:   7^(log₂n) = n^(log₂7) ≈ n^2.807