@article{DMTCS_2007_special_253_a20,
     author = {Coja-Oghlan, Amin and Krivelevich, Michael and Vilenchik, Dan},
     title = {Why almost all satisfiable $k${-CNF} formulas are easy},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)},
     year = {2007},
     doi = {10.46298/dmtcs.3538},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3538/}
}