Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.
Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.
Paul Beame, Richard M. Karp, Toniann Pitassi, Michael E. Saks. On the Complexity of Unsatisfiability Proofs for Random ::::k::::-CNF Formulas. In STOC. pages 561-571, 1998. [doi]
Abstract is missing.