Computational complexity of matrix multiplication: Difference between revisions

Revision as of 18:46, 23 October 2022

Revision as of 11:02, 3 November 2022

Line 329:

== External links ==

*[https://fmm.univ-lille.fr/ Yet another catalogue of fast matrix multiplication algorithms]

*[https://doi.org/10.1038/s41586-022-05172-4{{cite journal |last1=Fawzi, |first1=A., |last2=Balog, |first2=M., |last3=Huang, |first3=A. et|first4=T. al|last4=Hubert |first5=B. :"|last5=Romera-Paredes |first6=M. |last6=Barekatain |first7=A. |last7=Novikov |first8=F.J.R. |last8=Ruiz |first9=J. |last9=Schrittwieser |first10=G. |last10=Swirszcz |first11=D. |last11=Silver |first12=D. |last12=Hassabis |first13=P. |last13=Kohli |title=Discovering faster matrix multiplication algorithms with reinforcement learning", |journal=Nature |volume=610, pp.|issue= |pages=47–53 (|date=2022) |doi=10.]1038/s41586-022-05172-4 |url=}}

[[Category:Computer arithmetic algorithms]]