Question: Let HALF-CLAUSES = { | F is a 3cnf-formula where some assignment satisfies at least half of the clauses} Prove that HALF-CLAUSES is in P
Let HALF-CLAUSES = {
Prove that HALF-CLAUSES is in P by sketching a polynomial time algorithm that solves it. Briefly justify that your algorithm runs in polynomial.
Hint: For each variable make a greedy choice for whether to make it true or false.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
