2.3k views

The problem $3$-SAT and $2$-SAT are

1. both in P

2. both NP complete

3. NP-complete and in P respectively

4. undecidable and NP complete respectively

edited | 2.3k views

selected by

option C

$3$-SAT is NP complete

$2$-SAT is P

edited by
Ans is correct

But sir ,I read that SAT is NP-complete problem so why can't we say that 2-sat is also NP-complete

2-SAT is in P that indicates that there exists  deterministic alg which solves the problem in Polynomial time

so can't we write deterministic alg which solves the problem in Polynomial time  for 3-SAT problem too..

Please explain me this difference sir...
satisfiability problem are not np complete as always . as you see that 2 SAT is not a np complete .

3 SAT problem can be reduced to hamiltonian problem which is a NP complete problem . (with 3 literals )

2 SAT  problem is solved in polynomial time  . ( with 2 literal )

BTW do not call me sir , it sounds strange :D .

Option (c)  NP-complete and in P, respectively is the correct answer.

3 SAT - NPC Problem

2 SAT - p class problem

so option c
–1 vote
3 sat np and 2 sat p problem
–1 vote
Option C is correct.
2 sat is solvable in polynomial time whereas 3 sat is in np
3 Sat in NP-C