Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
xyzzyz
on Nov 29, 2011
|
parent
|
context
|
favorite
| on:
Matrix multiplication in O(n^2.373)
Most likely, it's not a practical algorithm, in the sense that it would yield practical time improvement only for unfeasibly large matrices. It does not matter for theorists, though -- for them it's still important result.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: