Hacker News new | past | comments | ask | show | jobs | submit login

Actually, solving most practical instances of NP hard problems is doable and quite tractable.



Obviously it depends a whole lot on the scale. They gave some idea of number of constraints required to be satisfied, but it's not clear to me what the actual constraints were. I think it's not outrageous that on scan it might have sounded intractable.


Actually, solving most practical instances of NP hard problems is doable and quite tractable.

Isn't that a tautology? Because if it wasn't doable then it wouldn't be practical.


Practical here means: Occurs in practice. And that they are optimally solvable in practice is not a tautology. It could be that you would need human insight (like you still need for most proving interesting mathematical theorems), or that people would only solve approximations. (People do solve approximations, too.)




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: