Finding a tree structure in a resolution proof is NP-complete
Work
Year: 2009
Type: article
Source: Theoretical Computer Science
Author Jan Hoffmann
Institution Ludwig-Maximilians-Universität München
Cites: 15
Cited by: 2
Related to: 10
FWCI: 0.4
Citation percentile (by year/subfield): 68.67
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze