Randomized vs. deterministic decision tree complexity for read-once Boolean functions
暂无分享,去创建一个
[1] Andrew Chi-Chih Yao. Lower bounds to randomized algorithms for graph properties , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[2] Marc Snir,et al. Lower Bounds on Probabilistic Linear Decision Trees , 1985, Theor. Comput. Sci..
[3] Valerie King. Lower bounds on the complexity of graph properties , 1988, STOC '88.
[4] Leslie G. Valiant,et al. Short Monotone Formulae for the Majority Function , 1984, J. Algorithms.
[5] Péter Hajnal. On the power of randomness in the decision tree model , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.
[6] Michael Tarsi,et al. Optimal Search on Some Game Trees , 1983, JACM.
[7] 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).
[8] Judea Pearl,et al. The solution for the branching factor of the alpha-beta pruning algorithm and its optimality , 1982, CACM.
[9] Avi Wigderson,et al. On read-once threshold formulae and their randomized decision tree complexity , 1990, Proceedings Fifth Annual Structure in Complexity Theory Conference.
[10] Michael E. Saks,et al. Probabilistic Boolean decision trees and the complexity of evaluating game trees , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).