Improved lower bounds on the randomized complexity of graph properties

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2076 LNCS, Issue , 2001, Pages 285-296

  Chakrabarti, Amit ^a   Khot, Subhash ^a  

^a Princeton University   (United States)

Author keywords

Decision tree complexity; Gaph packing; Mnotone graph properties; Pobabilistic method; Rn domized complexity; Rndomized algorithms

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; DECISION TREES; COMPUTATIONAL LINGUISTICS; DATA MINING; TREES (MATHEMATICS);

BIPARTITE GRAPHS; GRAPH PROPERTIES; N-VERTEX GRAPH; POBABILISTIC METHOD; PROBABILISTIC ARGUMENTS; PROBABILISTIC TECHNIQUE; RANDOMIZED DECISIONS; TREE COMPLEXITY; GRAPH PACKING; PROBABILISTIC METHODS; RANDOMIZED ALGORITHMS; RANDOMIZED COMPLEXITY;

TREES (MATHEMATICS); GRAPH THEORY;

EID: 42549083151     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_24     Document Type: Conference Paper

References (8)

1. Alon, N. , Spencer, J. H. The probabilistic method, Second Edition, Wiley-Interscience Series, 2000.
2. Appendix A Bollob́as, B. Extremal Graph Theory, Academic Press, 1978, Chapter 8.
3. Gr̈oger, H. D. On the randomized complexity of monotone graph properties, Acta Cybernetica, 10 (1992), 119-127.
4. Hajnal, P. An (n4 ) lower bound on the randomized complexity of graph 3 properties, Combinatorica, 11 (1991), 131-143.
5. Hajnal, P. , Szegedy, M. On packing bipartite graphs, Combinatorica, 12 (1992), 295-301.
6. King, V. Lower bounds on the complexity of graph properties, Proc. 20th ACM STOC (1988), 468-476.
7. Rivest, R. L. , Vuillemin, J. On recognizing graph properties from adjacency matrices, Theoret. Comput. Sci. , 3 (1976), 371-384.
8. Yao, A. C. Lower bounds to randomized algorithms for graph properties, Proc. 28th IEEE FOCS (1987), 393-400.