Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
bawolff
5 months ago
|
parent
|
context
|
favorite
| on:
Breaking the sorting barrier for directed single-s...
I still think matrix multiplication's O(n^2.371339) is super weird.
adgjlsfhk1
5 months ago
[–]
Matrix multiplication definitely should be O(n^(2+o(1))).
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: