Concours Commun Mines-Ponts
Concours Commun Mines-Ponts (CCMP)
Informatique Et Sciences IndustriellesEnglish
Exam overviewPractice session
Strassen's fast matrix multiplication algorithm multiplies two $n \times n$ matrices by recursively computing 7 submatrix multiplications of size $(n/2) \times (n/2)$ alongside $\Theta(n^2)$ matrix additions, satisfying the recurrence $T(n) = 7 T(n/2) + \Theta(n^2)$. According to the Master Theorem (théorème maître), what is the asymptotic time complexity $T(n)$?
Loading your practice session…