Hacker News
new
past
comments
ask
show
jobs
points
by
skissane
5 hours ago
|
comments
by
fpoling
3 hours ago
|
[-]
And vise versa, a proof that P!=NP do not exclude an algorithm that is fast enough for practical n.
reply
by
Dylan16807
1 hours ago
|
parent
|
[-]
Maybe, but that feels significantly more exotic and unlikely to me. You have to basically negate the natural cost scaling of brute force in the thousand to million n range but lose that speed benefit later.
reply