Finding a tree structure in a resolution proof is NP-complete (Q1019749): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:49, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding a tree structure in a resolution proof is NP-complete |
scientific article |
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
