Show SAT in O(1.5^n) via DPLL with unit propagation
Analyze the show sat in o(1.5^n) via dpll with unit propagation.
Examples
Input: "test_input_1"
Output: "output_1"
Input: "test_input_2"
Output: "output_2"
Hints
Recall that DPLL with unit propagation can be analyzed by considering how it reduces the problem size in the best and worst cases, focusing on the branching factor and the effect of unit propagation.
Consider a scenario where unit propagation eliminates exactly one variable per step, leading to a recurrence relation of the form T(n) = T(n-1) + T(n-2), and solve this recurrence to understand the time complexity.
Generalize the recurrence from Hint 2 to account for cases where unit propagation may eliminate more than one variable at a time, and derive the exact time complexity O(1.5^n) by analyzing the worst-case branching factor.
Show SAT in O(1.5^n) via DPLL with unit propagation
Analyze the show sat in o(1.5^n) via dpll with unit propagation.