The NP-hardness of finding a directed acyclic graph for regular resolution (Q924157): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2008.01.039 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2084517146 / rank | |||
Normal rank |
Revision as of 19:41, 19 March 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