Coppersmith–Winograd algorithm (Matrix Multiplication Matrix Product): Difference between revisions

Latest revision as of 10:17, 28 April 2023

$O(n^{2.{375}5})$

$O(n^{2})$ words

(Re-use of space in recursive branches)

Exact

No, deterministic

Word RAM

1990

Revision as of 12:13, 15 February 2023 (view source) Admin (talk \| contribs) No edit summary Tag: Manual revert ← Older edit	Latest revision as of 10:17, 28 April 2023 (view source) Admin (talk \| contribs) No edit summary Tag: Manual revert
(3 intermediate revisions by the same user not shown)
(No difference)