TR12-141 Authors: Dmitry Itsykson, Dmitry Sokolov

Publication: 2nd November 2012 23:26

Downloads: 3311

Keywords:

The paper is devoted to lower bounds on the time complexity of DPLL algorithms that solve the satisfiability problem using a splitting strategy. Exponential lower bounds on the running time of DPLL algorithms on unsatisfiable formulas follow from the lower bounds for resolution proofs. Lower bounds on satisfiable instances are also known for some classes of DPLL algorithms; this lower bounds are usually based on reductions to unsatisfiable instances. In this paper we consider DPLL algorithms with a cut heuristic that may decide that some branch of the splitting tree will not be investigated. DPLL algorithms with a cut heuristic always return correct answer on unsatisfiable formulas while they may err on satisfiable instances. We prove the theorem about effectiveness vs. correctness trade-off for deterministic myopic DPLL algorithms with a cut heuristic. Myopic algorithms can see formulas with erased signs of negations; they may also request a small number of clauses to read them precisely.

We construct a family of unsatisfiable formulas $\Phi^{(n)}$ and for every deterministic myopic algorithm $A$ we construct polynomial time samplable ensemble of distributions $R_n$ concentrated on satisfiable formulas such that if $A$ gives a correct answer with probability $0.01$ on a random formula from the ensemble $R_n$ then $A$ runs exponential time on the formulas $\Phi^{(n)}$.

One of the consequences of our result is the existence of a polynomial time samplable ensemble of distributions $Q_n$ concentrated on satisfiable formulas such that every deterministic myopic algorithm that gives a correct answer with probability $1 - o(1)$ on a random formula from the ensemble $Q_n$ runs exponential time on the formulas $\Phi^{(n)}$.

Other consequence is the following statement: for every deterministic myopic algorithm $A$ we construct a family of satisfiable formulas $\Psi^{(n)}$ and polynomial time samplable ensemble of distributions $R_n$ concentrated on satisfiable formulas such that if $A$ gives a correct answer with probability $0.01$ on a random formula from the ensemble $R_n$ then $A$ runs exponential time on the formulas $\Psi^{(n)}$.