Upper and Lower Bounds for Weak Backdoor Set Detection

Investor logo

Warning

This publication doesn't include Faculty of Sports Studies. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

NEELDHARA Misra ORDYNIAK Sebastian RAMAN Venkatesh SZEIDER Stefan

Year of publication 2013
Type Article in Proceedings
Conference Lecture Notes in Computer Science
MU Faculty or unit

Faculty of Informatics

Citation
Doi http://dx.doi.org/10.1007/978-3-642-39071-5_29
Field Information theory
Keywords satisfiability; weak backdoor sets;parameterized complexity; upper bounds; lower bounds
Description 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.54^k algorithm to detect whether there is a weak backdoor set of at most k variables into the class of Horn formulas; (ii)~a 2.27^k 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 6^k. We also prove a 2^k lower bound for these problems, subject to the Strong Exponential Time Hypothesis.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.

More info