Probabilistic Boolean decision trees and the complexity of evaluating game trees
暂无分享,去创建一个
[1] Michael Tarsi,et al. Optimal Search on Some Game Trees , 1983, JACM.
[2] Judea Pearl,et al. The solution for the branching factor of the alpha-beta pruning algorithm and its optimality , 1982, CACM.
[3] Michael E. Saks,et al. A topological approach to evasiveness , 1984, Comb..
[4] Daniel J. Kleitman,et al. Further results on the Aanderaa-Rosenberg conjecture , 1980, J. Comb. Theory, Ser. B.
[5] Arnold L. Rosenberg. On the time required to recognize properties of graphs: a problem , 1973, SIGA.
[6] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[7] Marc Snir,et al. Lower Bounds on Probabilistic Linear Decision Trees , 1985, Theor. Comput. Sci..
[8] Donald E. Knuth,et al. An Analysis of Alpha-Beta Pruning , 1975, Artif. Intell..
[9] Judea Pearl,et al. Asymptotic Properties of Minimax Trees and Game-Searching Procedures , 1980, Artif. Intell..
[10] Udi Manber,et al. The complexity of problems on probabilistic, nondeterministic, and alternating decision trees , 1985, JACM.
[11] Faculteit der Wiskunde en Natuurwetenschappen,et al. A sharpened version of the aanderaa-rosenberg conjecture , 1974 .
[12] Ronald L. Rivest,et al. On Recognizing Graph Properties from Adjacency Matrices , 1976, Theor. Comput. Sci..
[13] Friedhelm Meyer auf der Heide,et al. Nondeterministic versus probabilistic linear search algorithms , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).