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}
}
  • Neeldhara Misra, Sebastian Ordyniak, +1 author Stefan Szeider
  • Published 2013
  • Computer Science, Mathematics
  • ArXiv
  • 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

    Tables and Topics from this paper.

    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

    Which problems have strongly exponential complexity?

    On the Complexity of k-SAT