Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
gnu-nobody
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
3 ms
·
1.
▲
by
gnu-nobody
6y ago
> but O(n^2.807) time on a classical computer Optimizing matrix multiplication for classical computers is an open research problem, and according to wikipedia there are algorithms with O(n^2.37) running time. Also according to wikipedia,