Matched Formulas and Backdoor Sets

DOI10.1007/978-3-540-72788-0_12zbMath1187.68253MaRDI 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 complexity; maximum deficiency

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

Backdoor sets of quantified Boolean formulas, Computation of Renameable Horn Backdoors, A New Bound for an NP-Hard Subclass of 3-SAT Using Backdoors