Macready, William G.; Wolpert, David H. - Santa Fe Institute - 1995
We address the question "Are some classes of combinatorial optimization problems instrinsically harder than others, without regard to the algorithm one uses, or can difficulty only be assessed relative to particular algorithms?" <p> We provide a measure of the hardness of a particular optimization...</p>