Revision as of 23:42, 23 May 2021 edit Fawly (talk \| contribs) Extended confirmed users 584 edits unsolved template Tag: 2017 wikitext editor ← Previous edit		Revision as of 23:58, 23 May 2021 edit undo Fawly (talk \| contribs) Extended confirmed users 584 edits Changing short description Tag: 2017 wikitext editor Next edit →
Line 1: {{Short description\|algorithmic runtime requirements for matrix multiplication}} {{unsolved\|computer science\|What is the fastest algorithm for matrix multiplication?}} In [[theoretical computer science]], an active area of research is determining [[Analysis of algorithms\|how quickly]] the operation of [[matrix multiplication]] can be performed. [[Matrix multiplication algorithm]]s are a central subroutine in theoretical and [[numerical algorithm\|numerical]] algorithms for [[numerical linear algebra]] and [[optimization]], so finding the right amount of time it should take is of major practical relevance.

Computational complexity of matrix multiplication: Difference between revisions