NPSet of all decision problems which satisfiable answers can be verified in polynomial time.NP-CompleteNP-HardExamplesNP hardness of dominating set (reduction from Vertex Cover)2020-10-27