Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
I have seen couple of scheduling problem which says that the problem is NP hard. My question is that
1)when we say a problem is NP hard does it mean that it is not in NP?because if it is NP we say the problem is NP complete.
I know that a problem is in NPC if
a)it is in NP
b)it is NP hard.
If a problem is NP Hard, it may be in NP(then it’s a NP complete), but it could also be not in NP. The following is a Venn diagram of these classes: