Matched Formulas and Backdoor Sets

DOI10.1007/978-3-540-72788-0_12zbMath1187.68253OpenAlexW2118105153MaRDI QIDQ3612458

Stefan Szeider

Publication date: 10 March 2009

Published in: Theory and Applications of Satisfiability Testing – SAT 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-72788-0_12

zbMATH Keywords

parameterized complexitymaximum deficiency

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (4)

Computation of Renameable Horn Backdoors ⋮ A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors ⋮ Martin Davis’s Bibliography 1950–2015 ⋮ Backdoor sets of quantified Boolean formulas

This page was built for publication: Matched Formulas and Backdoor Sets