Finding a tree structure in a resolution proof is NP-complete (Q1019749)
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: Finding a tree structure in a resolution proof is NP-complete |
scientific article; zbMATH DE number 5559010
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding a tree structure in a resolution proof is NP-complete |
scientific article; zbMATH DE number 5559010 |
Statements
Finding a tree structure in a resolution proof is NP-complete (English)
0 references
28 May 2009
0 references
resolution
0 references
tree-like resolution
0 references
NP-completeness
0 references
0 references
0.799350380897522
0 references
0.7937756776809692
0 references
0.786178469657898
0 references
0.7795844674110413
0 references
