info@avatto.com
+91-9920808017
0. Consider two decision problems Q1, Q2 such that Q1 reduces in polynomial time to 3-SAT and 3- SAT reduces in polynomial time to Q2. Then which one of the following is consistent with the above statement?
Q1 is in NP, Q2 is NP hard
Q2 is in NP, Q1 is NP hard
Both Q1 and Q2 are in NP
Both Q1 and Q2 are NP hard
You must be logged in to post a comment.
Login with Facebook
Login with Google
Forgot your password?
Lost your password? Please enter your email address. You will receive mail with link to set new password.
Back to login
You must be logged in to post a comment.