Finite Playground

To verify is human; to prove, divine.

New improvement to fast matrix multiplication

by Leave a comment

最近花了許多時間讀資格考, 寫了不少筆記, 沒有時間寫網誌…  難得有新聞來寫一下!

Again the exponent for the fastest matrix multiplication algorithm is improved.  This time the magical number is 2.3728639, 0.0000630 better than Williams’ 2.3729269.  (Last time it goes from the famous CW bound 2.3754770 to Stothers’ 2.3736898 then to Williams’, a 0.0025501 improvement.)

Powers of Tensors and Fast Matrix Multiplication, François Le Gall, 2014.

Author: hcsoso

Researcher in computational topology and geometry; more broadly in theoretical computer science. Currently a postdoc in Department of Computer Science, Duke University.

Leave a comment