An Ω(n 4/3) lower bound on the randomized complexity of graph properties
- Péter Hajnal
- … show all 1 hide
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
We improve King's Ω(n 5/4) lower bound on the randomized decision tree complexity of monotone graph properties to Ω(n 4/3). The proof follows Yao's approach and improves it in a different direction from King's. At the heart of the proof are a duality argument combined with a new packing lemma for bipartite graphs.
- D. Angluin, andL. G. Valiant: Fast probabilistic algorithms for Hamiltonian circuits and matchings,Journal of Computer and System Sciences,19, 155–193.
- B. Bollobás:Extremal Graph theory, Chapter VIII., Academic Press, 1978.
- Catlin, P. A. (1974) Subgraphs of graphs I.. Discrete Math. 10: pp. 225-233
- Chernoff, H. (1952) A measure of asymptotic effiency for tests of a hypothesis based on the sum of observations. Annals of Math. Stat. 23: pp. 493-509
- King, V. (1991) An Ω(n 5/4) lower bound on the randomized complexity of graph properties. Combinatorica 11: pp. 47-56
- Kahn, J., Saks, M., Sturtevant, D. (1984) A topological aproach to evasiveness. Combinatorica 4: pp. 297-306
- L. Lovász:Combinatorial Problems and Exercises, North-Holland 1979.
- Rosenberg, A. L. (1973) On the time required to recognize properties of graphs: A problem. SIGACT News 5: pp. 15-16
- R. Rivest, andJ. Vuillemin: A generalization and proof of the Aanderaa-Rosenberg conjecture,Proc. 7th SIGACT Conference, (1975), ACM 1976.
- Sauer, N., Spencer, J. (1978) Edge-disjoint replacement of graphs. J. of Combinatorial Theory Ser. B 25: pp. 295-302
- A. Yao: Probabilistic computation: towards a unified measure of complexity,Proc. 18th IEEE FOCS, 1977, pp. 222–227.
- A. Yao: Lower bounds to randomized algorithms for graph properties,Proc. 28th IEEE FOCS, 1987, pp. 393–400.
- An Ω(n 4/3) lower bound on the randomized complexity of graph properties
Volume 11, Issue 2 , pp 131-143
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- 68 Q 15
- 05 C 35
- 05 C 80
- Industry Sectors
- Péter Hajnal (1) (2)
- Author Affiliations
- 1. Department of Computer Science, Princeton University, Princeton, USA
- 2. Bolyai Institute, University of Szeged, Hungary