next up previous
Next: Up: Previous:

NP-Completeness

NP-Complete problems are the hardest problems (no problem is harder) in NP, i.e., every problem in NP reduces to an NP-Complete problem.



\psfig{figure=figures/f26-2.ps}

If we can solve one NPC problem in polynomial time, we can solve every problem in NP in polynomial time. For this reason, many assume P $\neq$ NP.


next up previous
Next: Up: Previous: