Author:
Bulatov Andrei A.,Wang Cong
Publisher
Springer International Publishing
Reference19 articles.
1. Achlioptas, D., Naor, A., Peres, Y.: On the maximum satisfiability of random formulas. J. ACM 54(2) (2007)
2. Achlioptas, D., Peres, Y.: The threshold for random k-SAT is 2
k
ln 2 − o(k). J. AMS 17, 947–973 (2004)
3. Bellare, M., Goldreich, O., Sudan, M.: Free bits, PCPs, and nonapproximability-towards tight results. SIAM J. Comput. 27(3), 804–915 (1998)
4. Bollobás, B.: Random Graphs. Cambridge Studies in Advanced Mathematics, vol. 73. Cambridge University Press (2001)
5. Coja-Oghlan, A., Krivelevich, M., Vilenchik, D.: Why almost all k-CNF formulas are easy,
http://www.wisdom.weizmann.ac.il/vilenchi/papers/2007/UniformSAT.pdf