Accumulating Pruning Constraints: New Exact Polynomial-Space Algorithms for Max 2-SAT
We present deterministic polynomial-space algorithms that solve Max 2-SAT on $n$ variables exactly in time $\Ostar(2^{(1-γ)n})$, for a fixed $γ>0$, on several classes of instances whose clause density may grow with $n$. Our main tool extends the classic DPLL branching algorithm. When the search gives a variable its less promising value, comparing the two values of the variable yields a pruning…
We haven't written up this one. arXiv cs.AI has the full story — the link below goes straight to it.
