Question: Consider the following decision problem: 4-SAT: Given a gormula in Conjunctive Normal Form, where each clause contains exactly 4 literals, does it have a satisfyingh
Consider the following decision problem:
4-SAT: Given a gormula in Conjunctive Normal Form, where each clause contains exactly 4 literals, does it have a satisfyingh truth assignment?
(i) Prove that 4-SAT
NP
(ii) Prove that 4-SAT
NP Hard
(iii) Thereby prove that 4-SAT
NP Complete
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
