Givien two $$n\times n$$ matrices $$A$$ and $$B$$, the time comp

Givien two $$n\times n$$ matrices $$A$$ and $$B$$, the time complexity of the simple matrix multiplication $$C = A \cdot B$$ is $$O(n^3)$$. Now let's consider the following Divide and Conquer idea: Divide each matrix into four $$\frac{n}{2}\times\frac{n}{2}$$ submatrics as follows: $$\begin{bmatrix} C_1 & C_2 \\ C_3 & C_4 \end{bmatrix}$$ = $$\begin{bmatrix} A_1 & A_2 \\ A_3 & A_4 \end{bmatrix} \cdot \begin{bmatrix} B_1 & B_2 \\ B_3 & B_4 \end{bmatrix}$$ We recursively calculate each block of $$C$$ as $$C_1 = A_1\cdot B_1+A_2\cdot B_3$$ and so on. This can reduce the time complexity of the simple calculation. ~@[](2)

答案：FALSE