Open In App
Related Articles

Algorithms | NP Complete | Question 4

Improve Article
Save Article
Like Article

The problem 3-SAT and 2-SAT are


both in P


both NP complete


NP-complete and in P respectively


undecidable and NP-complete respectively

Answer: (C)


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 satisfactory if logical values can be assigned to its variables to make 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. 


Quiz of this Question
Please comment below if you find anything wrong in the above post

Last Updated : 28 Jun, 2021
Like Article
Save Article
Similar Reads