A lower bound for DLL algorithms for k-SAT (preliminary version)
نویسندگان
چکیده
There exist constants c k > 0, c k ! 0 as k ! 1, such that every DLL algorithm for the satissability of sets of disjunctions of size k using m variables runs for at least (2 m(1?c k)) steps on some inputs. Our proof is based on proving such a lower bound on the tree-like resolution proofs of generalized Tseitin tautologies.
منابع مشابه
Deterministic Algorithms for k-SAT Based on Covering Codes and Local Search
We show that satisfiability of formulas in k-CNF can be decided deterministically in time close to (2k/(k + 1)), where n is the number of variables in the input formula. This is the best known worstcase upper bound for deterministic k-SAT algorithms. Our algorithm can be viewed as a derandomized version of Schöning’s probabilistic algorithm presented in [15]. The key point of our algorithm is t...
متن کاملPDMI PREPRINT | 01/2000 ALGORITHMS FOR k-SAT BASED ON COVERING CODES
ALGORITHMS FOR k-SAT BASED ON COVERING CODES Evgeny DANTSIN1 Edward A. HIRSCH2 Russian A ademy of S ien es Russian A ademy of S ien es Steklov Mathemati al Institute Steklov Mathemati al Institute St. Petersburg Department St. Petersburg Department 27 Fontanka, St. Petersburg, 191011 27 Fontanka, St. Petersburg, 191011 Russia Russia E-mail: dantsin pdmi.ras.ru E-mail: hirs h pdmi.ras.ru January...
متن کاملAlgorithms for the satisfiability problem
This work deals with worst-case algorithms for the satisfiability problem regarding boolean formulas in conjunctive normal form. The main part of this work consists of the analysis of the running time of three different algorithms, two for 3-SAT and one for Unique-k-SAT. Research on the satisfiability problem has made reasonable progress during the last years. After the introduction in Chapter ...
متن کاملExponential Lower Bounds for DPLL Algorithms on Satisfiable Random 3-CNF Formulas
We consider the performance of a number of DPLL algorithms on random 3-CNF formulas with n variables and m = rn clauses. A long series of papers analyzing so-called “myopic” DPLL algorithms has provided a sequence of lower bounds for their satisfiability threshold. Indeed, for each myopic algorithm A it is known that there exists an algorithm-specific clause-density, rA, such that if r < rA, th...
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کامل