TY  - JOUR
AU  - Coja-Oghlan, Amin
AU  - Krivelevich, Michael
AU  - Vilenchik, Dan
TI  - Why almost all satisfiable $k$-CNF formulas are easy
JO  - Discrete mathematics & theoretical computer science
PY  - 2007
VL  - DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.3538/
DO  - 10.46298/dmtcs.3538
LA  - en
ID  - DMTCS_2007_special_253_a20
ER  -