| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 436388 | Theoretical Computer Science | 2008 | 6 Pages |
Abstract
Let R be a resolution refutation, given as a sequence of clauses without explicit description of the underlying dag. Then, it is NP-complete to decide whether R is a regular resolution refutation.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
