NP-Completeness, NP-Hardness and Reductions

A problem is NP-complete when it is both in NP and NP-hard; under the assumption $P \ne NP$ such problems have no polynomial-time algorithm, and we prove hardness by a polynomial-time reduction from a known hard problem like SAT, Knapsack, or TSP.