Randomized vs. deterministic decision tree complexity for read-once Boolean functions

@article{Heiman1991RandomizedVD,
  title={Randomized vs. deterministic decision tree complexity for read-once Boolean functions},
  author={Rafi Heiman and Avi Wigderson},
  journal={computational complexity},
  year={1991},
  volume={1},
  pages={311-329}
}
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denotedDC(f) andRC(f), respectively. A major open problem is how smallRC(f) can be with respect toDC(f). It is well known thatRC(f)≥DC(f) 0.5 for every Boolean functionf (called “0.5-exponent”). On the other hand, some Boolean functionf is known to haveRC(f) = Θ(DC(f))0.753...) (or “0.753...-exponent”). It is not known whether there is a Boolean function with exponent smaller than 0.753… CONTINUE READING

From This Paper

Topics from this paper.
21 Citations
1 References
Similar Papers

References

Publications referenced by this paper.

New Jersey 07962-1910 rafi@thumper.bellcore

  • Morristown
  • New Jersey 07962-1910 rafi@thumper.bellcore

Similar Papers

Loading similar papers…