Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
128
click to vote
TCS
2008
108
views
Theoretical Computer Science
»
more
TCS 2008
»
The NP-hardness of finding a directed acyclic graph for regular resolution
15 years 2 months ago
Download
www2.tcs.ifi.lmu.de
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 resolu...
Samuel R. Buss, Jan Hoffmann 0002
claim paper
Read More »