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

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

STOC, 1998.

@inproceedings{STOC-1998-BeameKPS, author = "Paul Beame and Richard M. Karp and Toniann Pitassi and Michael E. Saks", booktitle = "{Proceedings of the 30th Annual ACM Symposium on Theory of Computing}", doi = "10.1145/276698.276870", isbn = "0-89791-962-9", pages = "561--571", publisher = "{ACM}", title = "{On the Complexity of Unsatisfiability Proofs for Random k-CNF Formulas}", year = 1998, }