Key points are not available for this paper at this time.
We develop an automated approach for designing matrix multiplication algorithms based on constructions similar to the Coppersmith-Winograd construction. Using this approach we obtain a new improved bound on the matrix multiplication exponent ω<2.3727.
Virginia Vassilevska Williams (Sat,) studied this question.