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 the normal view instead:
scientific article; zbMATH DE number 6051313
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient arbitrary and resolution proofs of unsatisfiability for restricted tree-width |
scientific article; zbMATH DE number 6051313 |
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
0.8185260891914368
0 references
0.8135533928871155
0 references
0.8054528832435608
0 references
0.7964355945587158
0 references
0.7919781804084778
0 references
