Lower bounds on probabilistic linear decision trees

Marc Snir
1985 Theoretical Computer Science  
The power of probabilistic linear decision trees is examined. It is shown that the standard arguments used to prove lower bounds on deterministic linear decision trees apply to probabilistic linear decision trees as well. Examples are next given of problems which randomization helps solving. 0304-3975/85/$3.30 @ 1985, Elsevier Science Publishers B.V. (North-Holland)
doi:10.1016/0304-3975(85)90210-5 fatcat:xnhbumzz2zbyjlorkx3xeb55vi