Search over one million articles, find something about almost anything!
 

 
NPcomplete 
... satisfiability problem is NPcomplete.
It isn't really correct to say that NPcomplete problems are the hardest problems in NP. Assuming that P and NP are not equal, ... 

