Author:
Rathi Vishwambhar,Aurell Erik,Rasmussen Lars,Skoglund Mikael
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. AChlioptas, D., Moore, C.: Random k-SAT: Two moments suffice to cross a sharp threshold. SIAM J. COMPUT. 36, 740–762 (2006)
2. Achlioptas, D., Naor, A., Peres, Y.: On the maximum satisfiability of random formulas. Journal of the Association of Computing Machinary (JACM) 54 (2007)
3. AChlioptas, D., Peres, Y.: The threshold for random k-SAT is 2 k ln (2) − O(k). Journal of the American Mathematical Society 17, 947–973 (2004)
4. Barak, O., Burshtein, D.: Lower bounds on the spectrum and error rate of LDPC code ensembles. In: International Symposium on Information Theory, Adelaide, Australia (2002)
5. Bender, E.A., Richmond, L.B.: Central and local limit theorems applied to asymptotic enumeration II: Multivariate generating functions. J. Combin. Theory, Ser. A 34, 255–265 (1983)
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献