On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae

Miklos Santha. On the Monte Carlo Boolean Decision Tree Complexity of Read-Once Formulae. Random Struct. Algorithms, 6(1):75-88, 1995.

Abstract

Abstract is missing.