Backdoor Sets of Quantified Boolean Formulas
From MaRDI portal
Publication:3612469
DOI10.1007/978-3-540-72788-0_23zbMath1214.68372OpenAlexW1884103822MaRDI QIDQ3612469
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_23
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 (1)
This page was built for publication: Backdoor Sets of Quantified Boolean Formulas
