| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437808 | Theoretical Computer Science | 2009 | 6 Pages |
Abstract
The resolution tree problem consists of deciding whether a given sequence-like resolution refutation admits a tree structure. This paper shows the NP-completeness of both the resolution tree problem and a natural generalization of the resolution tree problem that does not involve resolution.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
