Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width (Q2894482)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width |
scientific article |
Statements
Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width (English)
0 references
29 June 2012
0 references
satisfiability testing
0 references
resolution proofs
0 references
tree-width
0 references
parameterized complexity
0 references
FPT
0 references
