NP-Completeness of Refutability by Literal-Once Resolution.

Stefan Szeider

Browse the full CADE paper archive.