Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
ufo
on May 27, 2013
|
parent
|
context
|
favorite
| on:
List of unsolved problems in computer science
the problem is that while dropping from n^2 to n log n is a big deal, dropping from (n log n) to n won't help much if you end up increasing the constant costs at the same time.
tel
on May 27, 2013
[–]
It will eventually. Practical problems are pretty much solved.
Consider applying for YC's W25 batch! Applications are open till Nov 12.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search:
