An Ω(n 5/4) lower bound on the randomized complexity of graph properties

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, access via your institution.

References

  1. [1]

    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.

  2. [2]

    J. Kahn, M. Saks, andD. Sturtevant A topological approach to evasiveness,Combinatorica 4 (1984), pp. 297–306.

    Google Scholar 

  3. [3]

    V. King:Lower bounds on the complexity of graph properties, Ph. D. Thesis, University of California, Berkeley, (May, 1988).

    Google Scholar 

  4. [4]

    D. J. Kleitman, andK. J. Kwiatkowski: Further results on the Aanderaa-Rosenberg conjecture.J. Combinatorial Theory 28 (1980), pp. 85–95.

    Google Scholar 

  5. [5]

    R. Rivest, andS. Vuillemin: On recognizing graph properties from adjacency matrices,Theor. Comp. Sci. 3 (1978) pp. 371–384.

    Google Scholar 

  6. [6]

    A. L. Rosenberg: On the time required to recognize properties of graph: a problem.SIGACT News 5 (4) (1973), pp. 15–16.

    Google Scholar 

  7. [7]

    N. Sauer, andJ. Spencer: Edge-disjoint placement of graphs,Combinatorial Theory, Ser. B,25, 3, (1978), pp. 295–302.

    Google Scholar 

  8. [8]

    P. Turán: On the theory of graphs,Colloq. Math. 3, (1954), pp. 19–30.

    Google Scholar 

  9. [9]

    A. Yao: Probabilistic computations: towards a unified measure of complexity,Proc. 18th Annual Symposium on the Foundations of Computer Science, (1977), pp. 222–227.

  10. [10]

    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.

Download references

Author information

Affiliations

Authors

Rights and permissions

Reprints and Permissions

About this article

Cite this article

King, V. An Ω(n 5/4) lower bound on the randomized complexity of graph properties. Combinatorica 11, 23–32 (1991). https://doi.org/10.1007/BF01375470

Download citation

AMS subject classification (1980)

  • 68 C 25
  • 68 E 10