Miklos Santha. On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. Random Struct. Algorithms, 6(1):75-88, 1995.
@article{Santha95,
title = {On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae},
author = {Miklos Santha},
year = {1995},
researchr = {https://researchr.org/publication/Santha95},
cites = {0},
citedby = {0},
journal = {Random Struct. Algorithms},
volume = {6},
number = {1},
pages = {75-88},
}