NP-Completeness of Refutability by Literal-Once Resolution

Stefan Szeider
January 2001
Cite
Type
Conference Paper
Stefan Szeider
Stefan Szeider
Head of Research Unit

Stefan Szeider is a Professor at the Algorithms and Complexity Group.