This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Downey RG, Fellows MR (2013) Fundamentals of parameterized complexity. Springer, London
Fischer E, Makowsky JA, Ravve ER (2008) Counting truth assignments of formulas of bounded tree-width or clique-width. Discret Appl Math 156(4):511–529
Fomin FV, Lokshtanov D, Misra N, Ramanujan MS, Saurabh S (2015) Solving d-SAT via backdoors to small treewidth. In: Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, San Diego, 4–6 Jan 2015. SIAM, pp 630–641
Ganian R, Ramanujan M, Szeider S (2014) Discovering archipelagos of tractability: split-backdoors to constraint satisfaction. Presented at PCCR 2014 – the 2nd workshop on the parameterized complexity of computational reasoning, Vienna
Gario M (2011) Backdoors for SAT. Master’s thesis, Dresden University of Technology. http://marco.gario.org/work/master/
Gaspers S, Szeider S (2012) Backdoors to acyclic SAT. In: Proceedings of the 39th international colloquium on automata, languages, and programming (ICALP 2012), Warwick. Lecture notes in computer science, vol 7391. Springer, pp 363–374
Gaspers S, Szeider S (2012) Backdoors to satisfaction. In: Bodlaender HL, Downey R, Fomin FV, Marx D (eds) The multivariate algorithmic revolution and beyond – essays dedicated to Michael R. Fellows on the occasion of his 60th birthday. Lecture notes in computer science, vol 7370. Springer, New York, pp 287–317
Gaspers S, Szeider S (2013) Strong backdoors to bounded treewidth SAT. In: 54th annual IEEE symposium on foundations of computer science, FOCS 2013, Berkeley, 26–29 Oct 2013. IEEE Computer Society, pp 489–498
Gaspers S, Misra N, Ordyniak S, Szeider S, Zivny S (2014) Backdoors into heterogeneous classes of SAT and CSP. In: Proceedings of the 28th AAAI conference on artificial intelligence (AAAI 2014), Québec City. AAAI Press, pp 2652–2658
Nishimura N, Ragde P, Szeider S (2004) Detecting backdoor sets with respect to Horn and binary clauses. In: Proceedings of the 7th international conference on theory and applications of satisfiability testing (SAT 2004), Vancouver, pp 96–103
Nishimura N, Ragde P, Szeider S (2007) Solving #SAT using vertex covers. Acta Informatica 44(7–8):509–523
Samer M, Szeider S (2010) Algorithms for propositional model counting. J Discret Algorithms 8(1):50–64
SAT competition (2002–) The international SAT competitions web page. http://www.satcompetition.org
Szeider S (2005) Backdoor sets for DLL subsolvers. J Autom Reason 35(1–3):73–88
Williams R, Gomes C, Selman B (2003) Backdoors to typical case complexity. In: Proceedings of the eighteenth international joint conference on artificial intelligence, IJCAI 2003. Morgan Kaufmann, San Francisco, pp 1173–1178
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Gaspers, S. (2016). Backdoors to SAT. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_781
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_781
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering