On the Complexity of Unsatisfiability Proofs for Random

Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks

Browse the full STOC paper archive.