"On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas."

Paul Beame et al. (1998)
a service of Schloss Dagstuhl - Leibniz Center for Informatics