Backdoors to Acyclic SAT

DOI10.1007/978-3-642-31594-7_31zbMath1272.68373arXiv1110.6384OpenAlexW2166599774MaRDI QIDQ2843262

Stefan Szeider, Serge Gaspers

Publication date: 12 August 2013

Published in: Automata, Languages, and Programming (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.6384

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (4)

Backdoors to Satisfaction ⋮ Complexity and approximability of parameterized MAX-CSPs ⋮ Backdoors to planning ⋮ Backdoors to tractable answer set programming

This page was built for publication: Backdoors to Acyclic SAT