News for hackers. Stuff that matters.

A comment on The Scientific Case for P≠NP. Parent comment

Re:The Scientific Case for P≠NP by UncleMeat on Sunday October 29, 2017 @12:26PM (#15579902)
This is false. There are NP-complete problems that, assuming P!=NP, there are provably no fast and good heuristics for these problems.
[ Parent | on HN ]
Re:The Scientific Case for P≠NP by lokerfoi on Wednesday November 01, 2017 @09:25AM (#15600900)
Really? Could I see some examples? Most results I've seen are on fixed approximation algorithms not on heuristics.
[ Parent | on HN ]