The Polynominal Complexity of Conjunctive Normal Form Satisfiability, when the Number of Conjunctions and Negations is Limited.

Nikolai K. Kossovsky, A. B. Prokhoroff

Browse the full LFCS paper archive.