Revision as of 20:38, 28 December 2021 edit Fawly (talk \| contribs) Extended confirmed users 584 edits Undid revision 1062371788 by 2601:193:8300:2920:3DFD:1CAF:EEBE:C119 (talk) clear WP:COI, looks like quackery Tag: Undo ← Previous edit		Revision as of 11:44, 5 February 2022 edit undo Qwerfjkl (bot) (talk \| contribs) Bots, Mass message senders 4,080,813 edits m Capitalising short description "algorithmic runtime requirements for matrix multiplication" per WP:SDFORMAT (via Bandersnatch) Next edit →
Line 1: {{Short description\|~~algorithmic~~Algorithmic runtime requirements for matrix multiplication}}▼ {{merge from\|Matrix multiplication algorithm\|discuss=Talk:Computational complexity of matrix multiplication#Merger proposal\|date=September 2021}} ▲{{Short description\|algorithmic runtime requirements for matrix multiplication}} {{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