Vassilevska Williams (Matrix Multiplication Matrix Product)

From Algorithm Wiki
Jump to navigation Jump to search

Time Complexity

$O(n^{2.{37287}3})$

Space Complexity

$O(n^{2})$ words

(Re-use of space in recursive branches)

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Word RAM

Year

2014

Reference

http://theory.stanford.edu/~virgi/matrixmult-f.pdf