Question

A problem is NP-complete if:

ItisatleastashardasthehardestproblemsinNPandisinNP

A It can be solved in polynomial time.

B It is in the P class.

C It is at least as hard as the hardest problems in NP and is in NP.

D It has a deterministic solution.

Practice Next