Subject
General Computer Science,Theoretical Computer Science
Reference33 articles.
1. D. Achlioptas, L. Kirousis, E. Kranakis, D. Krizanc, Rigorous results for random (2+p)-SAT, in: Proc. of RALCOM-97, pp. 1–10.
2. Random constraint satisfaction: a more accurate picture;Achlioptas,1997
3. Scaling and universality in continuous length combinatorial optimization;Aldous;Proc. Nat. Acad. Sci. USA,2003
4. P. Beame, R. Karp, T. Pitassi, M. Saks, On the complexity of unsatisfiability proofs for random k-CNF formulas, in: Proc. of STOC-98, pp. 561–571.
5. The efficiency of resolution and Davis-Putnam procedures;Beame;SIAM J. Comput.,2002
Cited by
62 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献