You must be logged in to read the answer. Go ahead and login, it'll take only a minute.
A problem is in the class NPC if it is in NP and is as hard as any problem in NP. A problem
is NP-hard if all problems in NP are polynomial time reducible to it, even though it may ...
Download our mobile app and study on-the-go. You'll get subjects, question papers, their solution, syllabus - All in one app.