Note on strong refutation algorithms for random k-SAT formulas
暂无分享,去创建一个
[1] Amin Coja-Oghlan,et al. An efficient regularity concept for sparse graphs and matrices , 2009 .
[2] Alan M. Frieze,et al. Random graphs , 2006, SODA '06.
[3] Uriel Feige,et al. Easily Refutable Subformulas of Large Random 3CNF Formulas , 2004, ICALP.
[4] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..
[5] Uriel Feige,et al. Witnesses for non-satisfiability of dense random 3CNF formulas , 2006, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06).
[6] Amin Coja-Oghlan,et al. Strong Refutation Heuristics for Random k-SAT , 2004, APPROX-RANDOM.
[7] Uriel Feige,et al. Easily refutable subformulas of large random 3CNF formulas , 2004, Theory of Computing.