Lower bounds on the complexity of graph properties
暂无分享,去创建一个
[1] Ronald L. Rivest,et al. On Recognizing Graph Properties from Adjacency Matrices , 1976, Theor. Comput. Sci..
[2] Joel H. Spencer,et al. Edge disjoint placement of graphs , 1978, J. Comb. Theory B.
[3] Andrew Chi-Chih Yao. Monotone Bipartite Graph Properties are Evasive , 1988, SIAM J. Comput..
[4] E. Wright,et al. An Introduction to the Theory of Numbers , 1939 .
[5] L RosenbergArnold. On the time required to recognize properties of graphs , 1973 .
[6] Daniel J. Kleitman,et al. Further results on the Aanderaa-Rosenberg conjecture , 1980, J. Comb. Theory, Ser. B.
[7] Robert Oliver,et al. Fixed-point sets of group actions on finite acyclic complexes , 1975 .
[8] P. Turán. On the theory of graphs , 1954 .
[9] Andrew Chi-Chih Yao. Lower bounds to randomized algorithms for graph properties , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[10] P. A. Smith. Fixed-Point Theorems for Periodic Transformations , 1941 .
[11] Arnold L. Rosenberg. On the time required to recognize properties of graphs: a problem , 1973, SIGA.
[12] Andrew Chi-Chih Yao,et al. Probabilistic computations: Toward a unified measure of complexity , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).