Talks and Poster Presentations (with Proceedings-Entry):
N. Misra, S. Ordyniak, V. Raman, St. Szeider:
"Upper and Lower Bounds for Weak Backdoor Set Detection";
Talk: International Conference on Theory and Applications of Satisfiability Testing (SAT),
Helsinki, Finland;
2013-07-08
- 2013-07-12; in: "Theory and Applications of Satisfiability Testing - SAT 2013",
M. Järvisalo, A. Van Gelder (ed.);
Springer / LNCS,
7962
(2013),
ISBN: 978-3-642-39070-8;
394
- 402.
English abstract:
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.
"Official" electronic version of the publication (accessed through its Digital Object Identifier - DOI)
http://dx.doi.org/10.1007/978-3-642-39071-5
Related Projects:
Project Head Stefan Szeider:
The Parameterized Complexity of Reasoning Problems
Created from the Publication Database of the Vienna University of Technology.