A Rearrangement Search Strategy for Determining Propositional Satisfiability
暂无分享,去创建一个
[1] Hilary Putnam,et al. A Computing Procedure for Quantification Theory , 1960, JACM.
[2] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.
[3] Ugo Montanari,et al. Networks of constraints: Fundamental properties and applications to picture processing , 1974, Inf. Sci..
[4] D. Knuth. Estimating the efficiency of backtrack programs. , 1974 .
[5] Edward M. Reingold,et al. Backtrack programming techniques , 1975, CACM.
[6] Robert M. Haralick,et al. Increasing Tree Search Efficiency for Constraint Satisfaction Problems , 1979, Artif. Intell..
[7] Janice M. Stone,et al. Efficient Search Techniques - An Empirical Study of the N-Queens Problem , 1987, IBM J. Res. Dev..