Amin Coja-Oghlan, Andreas Goerdt, André Lanka, Frank Schädlich. Certifying Unsatisfiability of Random 2::::k::::-SAT Formulas Using Approximation Techniques. In Andrzej Lingas, Bengt J. Nilsson, editors, Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings. Volume 2751 of Lecture Notes in Computer Science, pages 15-26, Springer, 2003. [doi]
Abstract is missing.