Backdoors to Satisfaction

@inproceedings{Gaspers2012BackdoorsTS,
  title={Backdoors to Satisfaction},
  author={Serge Gaspers and Stefan Szeider},
  booktitle={The Multivariate Algorithmic Revolution and Beyond},
  year={2012}
}
A backdoor set is a set of variables of a propositional formul a such that fixing the truth values of the variables in the backdoor s et moves the formula into some polynomial-time decidable class. If we know a smal l b ckdoor set we can reduce the question of whether the given formula is satis fiable to the same question for one or several easy formulas that belong to the t ractable class under consideration. In this survey we review parameterized c omplexity results for problems that arise in… CONTINUE READING
Highly Cited
This paper has 72 citations. REVIEW CITATIONS
Recent Discussions
This paper has been referenced on Twitter 3 times over the past 90 days. VIEW TWEETS

From This Paper

Figures, tables, and topics from this paper.
46 Citations
106 References
Similar Papers

Citations

Publications citing this paper.

73 Citations

051015'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 73 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 106 references

The complexity of satisfiability pro blems

  • Thomas J. Schaefer
  • InConference Record of the Tenth Annual ACM…
  • 1978
Highly Influential
11 Excerpts

an

  • A. Sabharwal, C. Ansotegui, C. Gomes, J. Hart, B. Selm
  • QBF modeling: Exploiting player symmetry for…
  • 2006
Highly Influential
9 Excerpts

Similar Papers

Loading similar papers…