Abstract
A decision tree algorithm determines whether an input graph withn nodes has a property by examining the entries of the graph's adjacency matrix and branching according to the information already gained. All graph properties which are monotone (not destroyed by the addition of edges) and nontrivial (holds for somes but not all graphs) have been shown to require Ω(n 2) queries in the worst case.
In this paper, we investigate the power of randomness in recognizing these properties by considering randomized decision tree algorithms in which coins may be flipped to determine the next entry to be examined. The complexity of a randomized algorithm is the expected number of entries that are examined in the worst case. The randomized complexity of a property is the minimum complexity of any randomized decision tree algorithm which computes the property. We improve Yao's lower bound on the randomized complexity of any nontrivial monotone graph property from Ω(n log1/12 n) to Ω(n 5/4).
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
P. Hajnal: An Ω(n 3/4) lower bound on the randomized complexity of graph properties,The University of Chicago Tech. Report 88-004, April 1988.
J. Kahn, M. Saks, andD. Sturtevant A topological approach to evasiveness,Combinatorica 4 (1984), pp. 297–306.
V. King:Lower bounds on the complexity of graph properties, Ph. D. Thesis, University of California, Berkeley, (May, 1988).
D. J. Kleitman, andK. J. Kwiatkowski: Further results on the Aanderaa-Rosenberg conjecture.J. Combinatorial Theory 28 (1980), pp. 85–95.
R. Rivest, andS. Vuillemin: On recognizing graph properties from adjacency matrices,Theor. Comp. Sci. 3 (1978) pp. 371–384.
A. L. Rosenberg: On the time required to recognize properties of graph: a problem.SIGACT News 5 (4) (1973), pp. 15–16.
N. Sauer, andJ. Spencer: Edge-disjoint placement of graphs,Combinatorial Theory, Ser. B,25, 3, (1978), pp. 295–302.
P. Turán: On the theory of graphs,Colloq. Math. 3, (1954), pp. 19–30.
A. Yao: Probabilistic computations: towards a unified measure of complexity,Proc. 18th Annual Symposium on the Foundations of Computer Science, (1977), pp. 222–227.
A. Yao: Lower bounds to randomized algorithms for graph properties,Proc 28th Annual Symposium on the Foundations of Computer Science, (1987), pp. 393–400. To appear inJour of Comp. Sys. Sci.