Revision as of 20:06, 22 September 2022 edit Comp.arch (talk \| contribs) Extended confirmed users 41,478 edits mNo edit summary Tag: 2017 wikitext editor ← Previous edit		Revision as of 08:55, 1 October 2022 edit undo Klbrain (talk \| contribs) Autopatrolled, Extended confirmed users, New page reviewers 97,764 edits Closing stale 2021 merge proposal; no case made; uncontested objection; see Talk:Computational complexity of matrix multiplication#Merge from Matrix multiplication algorithm Next edit →
Line 1: {{Short description\|Algorithmic runtime requirements for matrix multiplication}} ~~{{merge from\|Matrix multiplication algorithm\|discuss=Talk:Computational complexity of matrix multiplication#Merger proposal\|date=September 2021}}~~ {{unsolved\|computer science\|What is the fastest algorithm for matrix multiplication?}} In [[theoretical computer science]], the '''computational complexity of matrix multiplication''' dictates [[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