New submission at 2017-04-30 14:06:05.234168

9e830301-898b-4340-97f7-c8478277e652/meta.yml

+company: KU Leuven
+creator: Laurent Sorber, Marc Van Barel
+description: Naive multiplication of two N by N matrices requires N^3 scalar multiplications.
+  For N=2, Strassen showed that it could be done in only R=7 < 8=N^3 multiplications.
+  For N=3, it is known that 19 <= R <= 23, and for N=4 it is known that 34 <= R <=
+  49. This repository contains code that generates a mixed-integer linear program
+  (MILP) formulation of the fast matrix multiplication problem for finding solutions
+  with R < N^3 and proving that they are optimal. For a more detailed description,
+  see the accompanying manuscript.
+email: laurent.sorber@gmail.com
+license: cc-license
+name: Laurent Sorber
+other-license: ''
+owner: KU Leuven

9e830301-898b-4340-97f7-c8478277e652/sub.bib

+@misc{Sorber2017,
+author = {Laurent Sorber and Marc Van Barel},
+title = {{A mixed-integer linear program formulation for fast matrix multiplication}},
+howpublished = "\url{https://github.com/lsorber/fast-matrix-multiplication/blob/master/latex/fast-matrix-multiplication.pdf}",
+day = {30},
+month = {April},
+year = {2017}, 
+note = "[Online]"
+}
\ No newline at end of file