GATE | GATE-CS-2004 | Question 30
The problems 3-SAT and 2-SAT are
(A) both in P
(B) both NP-complete
(C) NP-complete and in P respectively
(D) undecidable and NP-complete respectively
Answer: (C)
Explanation: See https://www.geeksforgeeks.org/algorithms-np-complete-question-4/
Quiz of this Question
Last Updated :
28 Jun, 2021
Like Article
Save Article
Share your thoughts in the comments
Please Login to comment...