Of course DP is not the only methodology afflicted by this Curse. Indeed,
complexity theory advises us that we should distinguish between the complexity
of problems and complexity of algorithms. It should not surprise us therefore
that the DP formulation of the TSP is subjected to the Curse, after all this
problem is NP-hard.