Fixed-Parameter Tractable Reductions to SAT

DOI10.1007/978-3-319-09284-3_8zbMath1423.68444OpenAlexW195515244MaRDI QIDQ3192057

Ronald de Haan, Stefan Szeider

Publication date: 26 September 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-09284-3_8

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 (5)

Backdoors to Normality for Disjunctive Logic Programs ⋮ Parameterized complexity classes beyond para-NP ⋮ Unnamed Item ⋮ Strong Backdoors for Default Logic ⋮ On the query complexity of selecting minimal sets for monotone predicates

This page was built for publication: Fixed-Parameter Tractable Reductions to SAT