NP-complete is an unbreakable wall, strewn with the bloodied corpses of enthusiastic heuristic authors. You can only break it if your problem domain was never

NP-complete is an unbreakable wall, strewn with the bloodied corpses of enthusiastic heuristic authors. You can only break it if your problem domain was never NP-hard in the first place (e.g. sparse or some other exploitable structural features). Very very fast means nothing on a true NP-hard problem for quite modest n. Note the author had to include a spurious constraint to get his system to converge, despite it being quite a small task in the first place. My point was that this approach has fundamental reasons why it won't scale to real programming tasks, of which the interesting ones that programmers get wrong all the time are likely to be the true NP-complete type.