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 = { | F is a 3cnf-formula where some assignment satisfies at least half of the 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

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!