Skip to content
Related Articles

Related Articles

Algorithms | NP Complete | Question 4
  • Difficulty Level : Medium
  • Last Updated : 20 Feb, 2013
GeeksforGeeks - Summer Carnival Banner

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

Answer: (C)

Explanation: The Boolean satisfiability problem (SAT) is a decision problem, whose instance is a Boolean expression written using only AND, OR, NOT, variables, and parentheses. The problem is: given the expression, is there some assignment of TRUE and FALSE values to the variables that will make the entire expression true? A formula of propositional logic is said to be satisfiable if logical values can be assigned to its variables in a way that makes the formula true.

3-SAT and 2-SAT are special cases of k-satisfiability (k-SAT) or simply satisfiability (SAT), when each clause contains exactly k = 3 and k = 2 literals respectively.

2-SAT is P while 3-SAT is NP Complete. (See this for explanation)


Quiz of this Question

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.

My Personal Notes arrow_drop_up
Recommended Articles
Page :