# NP

Set of all decision problems which satisfiable answers can be verified in polynomial time.

NP-Complete^{ᛦ}

NP-Hard^{ᛦ}

## Examples

NP hardness of dominating set (reduction from Vertex Cover)^{ᛦ}

Set of all decision problems which satisfiable answers can be verified in polynomial time.

NP-Complete^{ᛦ}

NP-Hard^{ᛦ}

NP hardness of dominating set (reduction from Vertex Cover)^{ᛦ}