In the backtracking algorithm for SAT, suppose that we always choose a subproblem (CNF formula) that has a clause that is as small as possible; and we expand it along a variable that appears in this small clause. Show that if the input formula only contains clauses with two literals (that is, it is an instance of 2SAT), then a satisfying assignment, if one exists, will be found in polynomial time.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.