There is a special NP problem

S A T

A good algorithm for SAT will solve any problem in NP

We say that SAT is

NP-complete

SAT is "The hardest problem in NP"

(Cook 1971, Levin 1973.)