Upper and lower bounds for weak backdoor set detection

Authors:
Neeldhara Misra;Sebastian Ordyniak;Venkatesh Raman;Stefan Szeider
Affiliations:
Indian Institute of Science, Bangalore, India;Masaryk University Brno, Czech Republic;Institute of Mathematical Sciences, Chennai, India;Vienna University of Technology, Austria
Venue:
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Year:
2013

Citing 11
Cited 0

Recognition of q-Horn formulae in linear time

Discrete Applied Mathematics
Variable and term removal from Boolean formulae

Discrete Applied Mathematics
On the complexity of K-SAT

Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Which problems have strongly exponential complexity?

Journal of Computer and System Sciences
A perspective on certain polynomial-time solvable classes of satisfiability

Discrete Applied Mathematics
An efficient fixed-parameter algorithm for 3-hitting set

Journal of Discrete Algorithms
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Backdoors to typical case complexity

IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Backdoors to satisfaction

The Multivariate Algorithmic Revolution and Beyond
Backdoors to acyclic SAT

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Parameterized Complexity

Parameterized Complexity

Quantified Score

Hi-index	0.00

Visualization

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.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.