Improved bound for complexity of matrix multiplication (Q2837114)

The authors give a new bound for the exponents of the complexity of matrix multiplication, based on recursive use of two by two matrix multiplications. It is shown that this new bound is an improvement of previously reported bounds. The exposition in this paper is reasonably concise and self contained. The authors derive the results that they need in this paper from algebraic complexity theory and general background information. The essence if a combinatorial construction that is used in the paper is presented as a lemma. Parts of the argument may be of wider interest outside the algebraic complexity community. References to the articles in the relevant published literature are adequate and extensive.