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

Question

Quizplus · Accepted Answer

3-SAT is NP-complete because it is a well-known problem for which no polynomial-time algorithm is known, and it is used as a basis for proving the NP-completeness of other problems. On the other hand, 2-SAT is in P because there exists a polynomial-time algorithm to solve it, specifically through graph-based methods like strongly connected components.

The Problem 3-SAT and 2-SAT Are