Probabilistic Boolean decision trees and the complexity of evaluating game trees

@article{Saks1986ProbabilisticBD,
  title={Probabilistic Boolean decision trees and the complexity of evaluating game trees},
  author={M. Saks and A. Wigderson},
  journal={27th Annual Symposium on Foundations of Computer Science (sfcs 1986)},
  year={1986},
  pages={29-38}
}
  • M. Saks, A. Wigderson
  • Published 1986
  • Mathematics, Computer Science
  • 27th Annual Symposium on Foundations of Computer Science (sfcs 1986)
  • The Boolean Decision tree model is perhaps the simplest model that computes Boolean functions; it charges only for reading an input variable. We study the power of randomness (vs. both determinism and non-determinism) in this model, and prove separation results between the three complexity measures. These results are obtained via general and efficient methods for computing upper and lower bounds on the probabilistic complexity of evaluating Boolean formulae in which every variable appears… CONTINUE READING
    204 Citations
    Randomized Boolean Decision Trees: Several Remarks
    • 15
    • Highly Influenced
    On the power of randomness in the decision tree model
    • P. Hajnal
    • Mathematics, Computer Science
    • Proceedings Fifth Annual Structure in Complexity Theory Conference
    • 1990
    • 5
    Principles of Optimal Probabilistic Decision Tree Construction
    • 1
    • PDF
    Randomized vs. deterministic decision tree complexity for read-once Boolean functions
    • R. Heiman, A. Wigderson
    • Mathematics, Computer Science
    • [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference
    • 1991
    • 21
    • PDF
    On Directional vs. General Randomized Decision Tree Complexity for Read-Once Formulas
    • K. Amano
    • Computer Science, Mathematics
    • Chic. J. Theor. Comput. Sci.
    • 2011
    • 2
    • Highly Influenced
    • PDF
    On P versus NP $ \cap $ co-NP for decision trees and read-once branching programs
    • 35
    On O versus NP \cap co-NP for Decision Trees and Read-Once Branching Programs
    • 14
    Lower Bounds on the Randomized Communication Complexity of Read-Once Functions
    • N. Leonardos, M. Saks
    • Computer Science, Mathematics
    • 2009 24th Annual IEEE Conference on Computational Complexity
    • 2009
    • 11
    • PDF
    Randomized vs. deterministic decision tree complexity for read-once Boolean functions
    • 11
    • PDF
    On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae
    • M. Santha
    • Mathematics, Computer Science
    • Random Struct. Algorithms
    • 1995
    • 35

    References

    SHOWING 1-10 OF 17 REFERENCES
    Asymptotic Properties of Minimax Trees and Game-Searching Procedures
    • J. Pearl
    • Mathematics, Computer Science
    • Artif. Intell.
    • 1980
    • 152
    Nondeterministic versus probabilistic linear search algorithms
    • F. M. A. D. Heide
    • Computer Science
    • 26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
    • 1985
    • 11
    • PDF
    On Recognizing Graph Properties from Adjacency Matrices
    • 185
    Probabilistic computations: Toward a unified measure of complexity
    • A. Yao
    • Computer Science
    • 18th Annual Symposium on Foundations of Computer Science (sfcs 1977)
    • 1977
    • 997
    • PDF
    Optimal Search on Some Game Trees
    • 62
    A topological approach to evasiveness
    • 74
    Lower Bounds on Probabilistic Linear Decision Trees
    • M. Snir
    • Mathematics, Computer Science
    • Theor. Comput. Sci.
    • 1985
    • 115
    • PDF