Question

Can't break down from 3 to 2. Show that there is no way to build a 3-SAT clause (x vy v z) out of 2-SAT
parts. In other words, show that there is no 2-SAT formula o involving x, y, z and any number of
additional variables, such that o is satisfiable if and only if at least one of x, y, or z is true. However, this
does not prove that 3-SAT is not in P. Why not?​

Answer 1

Explanation:

sorry don't no

kskdjjjekskjwjndikwmsnksosokwmwnaksoskmsmwkwlsksmskks