For most computationally intractable problems there exists no heuristic that is equally effective on all instances. Rather, any given heuristic may do well on some instances but will do worse on others. Indeed, even the 'best' heuristics will be dominated by others on at least some subclasses of...

Complexity proofs often restrict themselves to stating that the problem at hand is a generalization of some other intractable problem, This proof technique relies on the widely accepted assumptions that complexity results hold regardless of the model formulation used to represent the problem and...

NP-completeness and other complexity proofs often merely State that the problem at hand is a generalization of some other intractable problem. This proof technique relies on the widely accepted assumption that complexity results hold regardless of the model formulation used to represent the...