Strassen's algorithm (Matrix Multiplication Matrix Product): Revision history

28 April 2023

• curprev 10:1710:17, 28 April 2023‎ Admin talk contribs‎ 369 bytes −38‎ No edit summary Tag: Manual revert
• curprev 10:1710:17, 28 April 2023‎ Admin talk contribs‎ 407 bytes +38‎ No edit summary Tags: Manual revert Reverted

10 April 2023

• curprev 09:3009:30, 10 April 2023‎ Admin talk contribs‎ 369 bytes −38‎ No edit summary Tags: Manual revert Reverted
• curprev 09:3009:30, 10 April 2023‎ Admin talk contribs‎ 407 bytes +38‎ No edit summary Tags: Manual revert Reverted

15 February 2023

• curprev 12:1312:13, 15 February 2023‎ Admin talk contribs‎ 369 bytes −38‎ No edit summary Tags: Manual revert Reverted
• curprev 12:1312:13, 15 February 2023‎ Admin talk contribs‎ 407 bytes +38‎ No edit summary Tags: Manual revert Reverted
• curprev 11:3211:32, 15 February 2023‎ Admin talk contribs‎ 369 bytes −38‎ No edit summary

• curprev 11:3211:32, 15 February 2023‎ Admin talk contribs‎ 407 bytes +407‎ Created page with "== Time Complexity == $O(n^{(log7/log2)}) ~ O(n^{2.{80}7})$ == Space Complexity == $O(n^{2})$ words (http://www.cs.cmu.edu/afs/cs/academic/class/15750-s17/ScribeNotes/lecture1.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1969 == Reference == https://link.springer.com/article/10.1007%2FBF02165411"