Random k-Sat: A Tight Threshold For Moderately Growing k
暂无分享,去创建一个
[1] Svante Janson,et al. Bounding the unsatisfiability threshold of random 3-SAT , 2000, Random Struct. Algorithms.
[2] L. Kirousis,et al. Approximating the unsatisfiability threshold of random formulas , 1998 .
[3] Alan M. Frieze,et al. Analysis of Two Simple Heuristics on a Random Instance of k-SAT , 1996, J. Algorithms.
[4] Ming-Te Chao,et al. Probabilistic Analysis of Two Heuristics for the 3-Satisfiability Problem , 1986, SIAM J. Comput..
[5] Ming-Te Chao,et al. Probabilistic analysis of a generalization of the unit-clause literal selection heuristics for the k satisfiability problem , 1990, Inf. Sci..
[6] Alan M. Frieze,et al. On the satisfiability and maximum satisfiability of random 3-CNF formulas , 1993, SODA '93.
[7] Dimitris Achlioptas,et al. Optimal myopic algorithms for random 3-SAT , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[8] Alan M. Frieze,et al. A note on random 2-SAT with prescribed literal degrees , 2002, SODA '02.
[9] E. Friedgut,et al. Sharp thresholds of graph properties, and the -sat problem , 1999 .
[10] Yann Verhoeven. Random 2-SAT and unsatisfiability , 1999, Inf. Process. Lett..
[11] Andreas Goerdt,et al. A Threshold for Unsatisfiability , 1992, MFCS.
[12] Béla Bollobás,et al. The scaling window of the 2‐SAT transition , 1999, Random Struct. Algorithms.
[13] Olivier Dubois,et al. Typical random 3-SAT formulae and the satisfiability threshold , 2000, SODA '00.
[14] Bruce A. Reed,et al. Mick gets some (the odds are on his side) (satisfiability) , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.