Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width
type: Item
instance of: scholarly article
title: Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width
zbMATH Open document ID: 1353.68125
DOI: 10.1007/978-3-642-29344-3_33
published in: LATIN 2012: Theoretical Informatics
publication date: 2012-06-29T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03F20
zbMATH DE Number: 6051313
zbMATH Keywords: satisfiability testing
zbMATH Keywords: resolution proofs
zbMATH Keywords: tree-width
zbMATH Keywords: parameterized complexity
zbMATH Keywords: FPT
author: Martin Fürer
MaRDI profile type: Publication
full work available at URL: 978-3-642-29344-3 33
OpenAlex ID: W151552961
description: scientific article