Question: Problem 1. (10 pts.) In the EXACT 4-SAT problem, the input is a set of clauses, each of which is a disjunction of exactly four

Problem 1. (10 pts.) In the EXACT 4-SAT problem, the input is a set of clauses, each of which is a disjunction of exactly four literals, and such that each variable occurs at most once in each clause. The goal is to find a satisfying assignment, f one exists. Prove that EXACT 4-SAT is NP-complete
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
