%0 Journal Article
%A Coja-Oghlan, Amin
%A Krivelevich, Michael
%A Vilenchik, Dan
%T Why almost all satisfiable $k$-CNF formulas are easy
%J Discrete mathematics & theoretical computer science
%D 2007
%V DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3538/
%R 10.46298/dmtcs.3538
%G en
%F DMTCS_2007_special_253_a20