Y
Hacker News
new
|
ask
|
show
|
jobs
by
thomasahle
3212 days ago
Computational hardness doesn't depend on whether anybody knows an efficient algorithm. Just whether one exists.
1 comments
taeric
3212 days ago
Fair enough. I was obviously reading the above as having a polynomial time as having an efficient time one. Where efficient was shorthand for "quick." Both leaps, I concede were misguided.
link