We obtain upper and lower bounds for running times of exponential time algorithms for the detection of weak backdoor sets of 3CNF formulas, considering various base classes. These results include (omitting polynomial factors), (i) a 4.54k algorithm to detect whether there is a weak backdoor set of at most k variables into the class of Horn formulas; (ii) a 2.27k algorithm to detect whether there is a weak backdoor set of at most k variables into the class of Krom formulas. These bounds improve an earlier known bound of 6k. We also prove a 2k lower bound for these problems, subject to the Strong Exponential Time Hypothesis. © 2013 Springer-Verlag.
CITATION STYLE
Misra, N., Ordyniak, S., Raman, V., & Szeider, S. (2013). Upper and lower bounds for weak backdoor set detection. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7962 LNCS, pp. 394–402). https://doi.org/10.1007/978-3-642-39071-5_29
Mendeley helps you to discover research relevant for your work.