On boolean decision trees with faulty nodes

We consider the problem of computing with faulty components in the context of the Boolean decision tree model, in which cost is measured by the number of input bits queried, and the responses to queries are faulty with a fixed probability. We show that if f can be represented in k-DNF form and in j-CNF form, then O(n log(min(k, j)/q)) queries suffice to compute f with error probability less than q, where n is the number of input bits. © 1994 John Wiley & Sons, Inc.