The problem 3-SAT and 2-SAT are

M

Mr. Dubey

🎓 Coach ⭐ 104.48K Points

📊 Theory of Computation

Q. The problem 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

💬 Discuss

✅ Correct Answer: (C) NP-complete and in P respectively

You must be Logged in to update hint/solution

💬 Discussion

📊 Question Analytics

👁️

842

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

92%

Success Rate