Albert Atserias. Unsatisfiable Random Formulas Are Hard to Certify. In 17th IEEE Symposium on Logic in Computer Science (LICS 2002), 22-25 July 2002, Copenhagen, Denmark, Proceedings. pages 325-334, IEEE Computer Society, 2002. [doi]
Abstract is missing.