Algorithm Design

466
Chapter 8 NP and Computation!l Intractability
for this consistent failure is that these problems simply cannot be solved in
polynomial time.
8.4 NP-Complete Problems
In the absence of progress on the ~P = ~T question, people have turned to a
related but more approachable question: What are the hardest problems in
N~p~. Polynomial-time reducibility gives us a way of addressing this question
and gaining insight into the structure of NT.
Arguably the most natural way to define a "hardest" problem X is via the
following two properties: (i) X E N~P; and (ii) for all Y E 3~T, Y _