Abstract
We prove a lower bound of Ω(n 4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex bipartite graph property, thereby improving the previous bound of Ω(n 4/3) due to Hajnal [H91]. Our proof works by improving a probabilistic argument in that paper, which also improves a graph packing lemma proved there. By a result of Gröger [G92] our complexity lower bound carries over from bipartite to general monotone n-vertex graph properties. Graph packing being a well-studied subject in its own right, our improved packing lemma and the probabilistic technique used to prove it, may be of independent interest.
This work was supported in part by NSF Grant CCR-96-23768, ARO Grant DAAH04-96-1-0181, and NEC Research Institute.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Alon, N., Spencer, J. H. The probabilistic method, Second Edition, Wiley-Interscience Series, 2000, Appendix A.
Bollobás, B. Extremal Graph Theory, Academic Press, 1978, Chapter 8.
Gröger, H. D. On the randomized complexity of monotone graph properties, Acta Cybernetica, 10 (1992), 119–127.
Hajnal, P. An Ω(n 4/3) lower bound on the randomized complexity of graph properties, Combinatorica, 11 (1991), 131–143.
Hajnal, P., Szegedy, M. On packing bipartite graphs, Combinatorica, 12 (1992), 295–301.
King, V. Lower bounds on the complexity of graph properties, Proc. 20th ACM STOC (1988), 468–476.
Rivest, R.L., Vuillemin, J. On recognizing graph properties from adjacency matrices, Theoret. Comput. Sci., 3 (1976), 371–384.
Yao, A.C. Lower bounds to randomized algorithms for graph properties, Proc. 28th IEEE FOCS (1987), 393–400.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chakrabarti, A., Khot, S. (2001). Improved Lower Bounds on the Randomized Complexity of Graph Properties. In: Orejas, F., Spirakis, P.G., van Leeuwen, J. (eds) Automata, Languages and Programming. ICALP 2001. Lecture Notes in Computer Science, vol 2076. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48224-5_24
Download citation
DOI: https://doi.org/10.1007/3-540-48224-5_24
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42287-7
Online ISBN: 978-3-540-48224-6
eBook Packages: Springer Book Archive