Algorithms exist that provide better running times than the straightforward ones.
The current algorithm with the lowest known exponent is a generalization of the Coppersmith-Winograd algorithm that has an asymptotic complexity of , by François Le Gall [REF].