Backdoor treewidth for SAT

DOI10.1007/978-3-319-66263-3_2zbMath1496.68256OpenAlexW2743104256MaRDI QIDQ1680239

Stefan Szeider, M. S. Ramanujan, Robert Ganian

Publication date: 15 November 2017

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

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Computational aspects of satisfiability (68R07)

Related Items (4)

Distance from triviality 2.0: hybrid parameterizations ⋮ SAT backdoors: depth beats size ⋮ Measuring what matters: a hybrid approach to dynamic programming with treewidth ⋮ Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth.

This page was built for publication: Backdoor treewidth for SAT