3 ms·
> 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.
by copperx 5y ago
> 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.
- warrenm 5y agoTraveling 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"