Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
We consider the role of randomness for the decisional complexity in algebraic decision (or computation) trees, i.e., the number of comparisons ignoring all other computation. Recently Ting and Yao showed that the problem of finding the maximum of n elements has decisional complexity O (log2 n) (1994, Inform. Process. Lett., 49, 39-43). In contrast, Rabin showed in 1972 an &Ohgr;(n) bound for the deterministic case (1972, J. Comput. System Sci., 6, 639-650). We point out that their technique is applicable to several problems for which corresponding &Ohgr;(n) lower bounds hold. We show that in general the randomized decisional complexity is logarithmic in the size of the decision tree. We then turn to the question of the number of random bits needed to obtain the Ting and Yao result. We provide a deterministic O (k log n) algorithm for finding the elements which are larger than a given element, given a bound k on the number of these elements. We use this algorithm to obtain an O (log2 n) random bits and O (log2 n) queries algorithm for finding the maximum. Copyright 2001 Academic Press.