Easy Problems are Sometimes Hard
暂无分享,去创建一个
[1] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[2] Tad Hogg,et al. The Hardest Constraint Problems: A Double Phase Transition , 1994, Artif. Intell..
[3] Yumi K. Tsuji,et al. EVIDENCE FOR A SATISFIABILITY THRESHOLD FOR RANDOM 3CNF FORMULAS , 1992 .
[4] Peter C. Cheeseman,et al. Where the Really Hard Problems Are , 1991, IJCAI.
[5] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[6] Toby Walsh,et al. The SAT Phase Transition , 1994, ECAI.
[7] Paul Walton Purdom,et al. The Pure Literal Rule and Polynomial Average Time , 1985, SIAM J. Comput..
[8] Toby Walsh,et al. The Hardest Random SAT Problems , 1994, KI.
[9] James M. Crawford,et al. Experimental Results on the Crossover Point inSatis ability , 1993 .
[10] Hector J. Levesque,et al. Hard and Easy Distributions of SAT Problems , 1992, AAAI.