Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

> Every problem gets solvable if you break it into enough pieces

Someone needs to just sit down and break P vs NP into enough pieces.



Traveling Salesman is "solved" basically this way with modern map apps: it may not be "optimal", but it's close enough

And close enough, as the adage goes, is almost always "close enough"




Consider applying for YC's Winter 2026 batch! Applications are open till Nov 10

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

Search: