D9929296 Homework #7: Answer the following questions. 1. Determine whether the following statements are correct or not.

t. (1) If a problem is NP-complete, then it cannot be solved by any polynomial algorithm in worst cases. NO (2) If a problem is NP-complete, then we have not found any polynomial algorithm to solve it in worst cases. YES polynomial algorithm (3) If a problem is NP-complete, then it is unlikely that a polynomial algorithm can be found in the future to solve it in worst cases. YES (4) If a problem is NP-complete, then it is unlikely that we can find a polynomial algorithm to solve it in average cases. NO average cases (5) If we can prove that the lower bound of an NP-complete problem is exponential, then we have proved that NP P. YES 2. Determine the satisfiability of each of the following sets of clauses. Explain your decision process for each clause set. (1) X1 X2 X3 X1 X2 X3 X3 (1)^(2) (3)^(4) (5)^(6) (7)^(4) X2 X3 X2 X3 (1) (2) (3) (4) (5) (6) (7) not satisfiabile

(2) X1 X1 X1 X1 X1 X1 X1 X1 (1)^(2) (3)^(5) (4)^(6) (7)^(8)

X2 X2 X2 X2 X2 X2 X2 X2

X3 X3 X3 X3 X3 X3 X3 X3 X2 X3 X2 X3 X1 X3 X1 X3 X3 X3

(1) (2) (3) (4) (5) (6) (7) (8) (9) (10) (11) (12) (13) (14) not satisfiabile

(9)^(10) (11)^(12) (13)^(14)

(3) X1 X2 X3 X1 X2 X3 (1)^(2) (3)^(4) X2 X3 X2 X3

(1) (2) (3) (4) Thus this set of clauses is satisfiable

(4) X1 X2 X3 X1 X2 (1)^(2) (3)^(4) (5) X1 X2 X3 (1)^(2) (3)^(4) X1 X2 X3 X1 X2 X3

(1) (2) (3) (4) Thus this set of clauses is satisfiable

X2 X3 X1 X3 X1

(1) (2) (3) (4) Thus this set of clauses is satisfiable

3. We all know how to prove that a problem is NP-complete. How can we prove that a problem is not NP-complete? ANPC BNPC B A ANPC(NPC )