NP、NPC、NP-Hard

P类: 已有多项式时间算法的判定问题.

NP问题（Non-deterministic problem）：多项式复杂程度的非确定性问题。 NP 就是指能在多项式时间内 验证 一个解是否满足的一类问题。

NPC问题：而如果任何一个NP问题都能通过一个多项式时间算法转换为某个NP问题，那么这个NP问题就称为NP完全问题（Non-deterministic Polynomial complete problem）。NP完全问题也叫做NPC问题。

NP-Hard ：Class of problems which are at least as hard as the hardest problems in NP. Problems that are NP-hard do not have to be elements of NP; indeed, they may not even be decidable（可判定的）.

Consequences：

－If P ≠ NP, then NP-hard problems cannot be solved in polynomial time;

－If an optimization problem H has an NP-complete decision version L, then H is NP-hard.

关系图: