Improved lower bounds on the randomized complexity of graph properties

Random Structures and Algorithms

Volumn 30, Issue 3, 2007, Pages 427-440

  Chakrabarti, Amit ^a   Khot, Subhash ^b  

^a Dartmouth College   (United States)

^b Georgia Institute of Technology   (United States)

Author keywords

Complexity; Decision trees; Graph packing; Graph properties; Probabilistic method; Randomized algorithms

Indexed keywords

EID: 34247525606     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20164     Document Type: Article

References (14)

1. N. Alon and J. H. Spencer, The probabilistic method, Wiley-Interscience, New York, 2000.
2. B. Bollobás, Extremal graph theory, Academic Press, New York, NY, 1978.
3. A. Chakrabarti, S. Khot, and Y. Shi, Evasiveness of subgraph containment and related properties, SIAM J Comput 31 (2002), 866-875.
4. D.-Z, Du and K.-I. Ko, Theory of computational complexity, John Wiley and Sons, New York, NY, 2000.
5. E. Friedgut, J. Kahn, and A. Wigderson, "Computing graph properties by randomized subcube partitions," In Proceedings of the 6th International Workshop on Randomization and Approximation Techniques in Computer Science, Cambridge, MA, 2002, pp. 105-113.
6. H. D. Gröger, On the randomized complexity of monotone graph properties, Acta Cybernetica 10 (1992), 119-127.
7. 4/3) lower bound on the randomized complexity of graph properties, Combinatorica 11 (1991), 131-143.
8. W. Hoeffding, Probability inequalities for sums of bounded random variables, J Amer Stat Assoc 58 (1963), 13-30.
9. P. Hajnal and M. Szegedy, On packing bipartite graphs, Combinatorica 11 (1992), 295-301.
10. V. King, "Lower bounds on the complexity of graph properties," In Proceedings of the 20th Annual ACM Symposium on the Theory of Computing, Chicago, IL, 1988, pp. 468-476.
11. J. Kahn, M. Saks, and D. Sturtevant, A topological approach to evasiveness, Combinatorica 4 (1984), 297-306.
12. R. L. Rivest and J. Vuillemin, On recognizing graph properties from adjacency matrices, Theor Comput Sci 3 (1976), 371-384.
13. A. C. Yao, "Lower bounds to randomized algorithms for graph properties," In Proceedings of the 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, 1987, pp. 393-400.
14. A. C. Yao, Monotone bipartite graph properties are evasive, SIAM J Comput 17 (1988), 517-520.