Certifying Unsatisfiability of Random 2<i>k</i>-SAT Formulas Using Approximation Techniques.

Amin Coja-Oghlan Andreas Goerdt André Lanka Frank Schädlich Certifying Unsatisfiability of Random 2<i>k</i>-SAT Formulas Using Approximation Techniques. 15-26 http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=2751&spage=15 2003 conf/fct/2003 FCT db/conf/fct/fct2003.html#Coja-OghlanGLS03