You are given a standard O(n^3) matrix multiplication implementation. Your task is to explain how you would refactor this implementation to use Strassen's algorithm or the Coppersmith–Winograd algorithm. Discuss the mathematical implications of changing the complexity, specifically the overhead introduced by the recursive calls and the increased memory footprint. Provide a pseudo-code representation of the recursive base case and the matrix splitting logic.