Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT.

Amin Coja-Oghlan Andreas Goerdt André Lanka Frank Schädlich Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT. 1-45 2004 329 Theor. Comput. Sci. 1-3 http://dx.doi.org/10.1016/j.tcs.2004.07.017 db/journals/tcs/tcs329.html#Coja-OghlanGLS04