Sciweavers

Share
TCS
2008

The NP-hardness of finding a directed acyclic graph for regular resolution

8 years 5 months ago
The NP-hardness of finding a directed acyclic graph for regular resolution
Let R be a resolution refutation, given as a sequence of clauses without explicit description of the underlying dag. Then, it is NPcomplete to decide whether R is a regular resolution refutation.
Samuel R. Buss, Jan Hoffmann 0002
Added 15 Dec 2010
Updated 15 Dec 2010
Type Journal
Year 2008
Where TCS
Authors Samuel R. Buss, Jan Hoffmann 0002
Comments (0)
books