Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width

DOI10.1007/978-3-642-29344-3_33zbMath1353.68125OpenAlexW151552961MaRDI QIDQ2894482

Martin Fuerer

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29344-3_33

zbMATH Keywords

tree-widthparameterized complexityFPTresolution proofssatisfiability testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of proofs (03F20)

Related Items (2)

NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability ⋮ Regular Resolution Versus Unrestricted Resolution

This page was built for publication: Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width