The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:31, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The NP-hardness of finding a directed acyclic graph for regular resolution |
scientific article |
Statements
The NP-hardness of finding a directed acyclic graph for regular resolution (English)
0 references
28 May 2008
0 references
resolution
0 references
regular resolution
0 references
NP-completeness
0 references
directed acyclic graph
0 references
