linguistic:voice_change
Theoretical complexity

If two matrices of order n can be multiplied in time M (n), where M (n) ≥ n for some a > 2, then an LU decomposition can be computed in time O(M (n)). This means, for example, that an O(n) algorithm exists based on the Coppersmith–Winograd algorithm.