, Volume 11, Issue 2, pp 131-143

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

Rent the article at a discount

Rent 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.

The paper was written while the author was a graduate student at the University of Chicago and was completed at M.I.T. The work was supported in part by NSF under GRANT number NSF 5-27561, the Air Force under Contract OSR-86-0076 and by DIMACS (Center for Discret Mathematics and Theoretical Computer Science), a National Science Foundation Science and Technology Center-NSF-STC88-09648.