3 ms·
To me the most exciting part is that this may lead to a faster fast matrix multiplication algorithm which will be huge. The current bound is O(n^~2.372). They c
by esturk 10y ago
To me the most exciting part is that this may lead to a faster fast matrix multiplication algorithm which will be huge. The current bound is O(n^~2.372). They could very feasibly hit the theoretical limit of O(n^2+e).