# Upper and Lower Bounds for Weak Backdoor Set Detection

@article{Misra2013UpperAL, title={Upper and Lower Bounds for Weak Backdoor Set Detection}, author={Neeldhara Misra and Sebastian Ordyniak and Venkatesh Raman and Stefan Szeider}, journal={ArXiv}, year={2013}, volume={abs/1304.5518} }

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… CONTINUE READING

#### Supplemental Presentations

#### Citations

##### Publications citing this paper.

## SAT-based analysis of large real-world feature models is easy

VIEW 2 EXCERPTS

CITES BACKGROUND

HIGHLY INFLUENCED

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 28 REFERENCES

## Backdoors to Satisfaction

VIEW 5 EXCERPTS

## Backdoors to Acyclic SAT

VIEW 1 EXCERPT

## Lower bounds based on the Exponential Time Hypothesis

VIEW 1 EXCERPT

## Backdoors to q-Horn

VIEW 2 EXCERPTS

## Backdoors To Typical Case Complexity

VIEW 1 EXCERPT