📢 Too many exams? Don’t know which one suits you best? Book Your Free Expert 👉 call Now!

Question

A problem is NP-complete if:

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

More IT Networking Questions

कार्यालयीन आदेश सदैव प्रेषित होता हैः

Relevant for Exams:

NIC Recruitment

ask-question