Rounds versus Time for the Two Person Pebble Game (Extended Abstract)
暂无分享,去创建一个
[1] Leslie G. Valiant,et al. Circuit Size is Nonlinear in Depth , 1976, Theor. Comput. Sci..
[2] Leslie G. Valiant,et al. Graph-Theoretic Arguments in Low-Level Complexity , 1977, MFCS.
[3] Robert E. Tarjan,et al. Space bounds for a game on graphs , 1976, STOC '76.
[4] Walter L. Ruzzo. On Uniform Circuit Complexity , 1981, J. Comput. Syst. Sci..
[5] J. Rissanen. A UNIVERSAL PRIOR FOR INTEGERS AND ESTIMATION BY MINIMUM DESCRIPTION LENGTH , 1983 .
[6] Leslie G. Valiant,et al. On non-linear lower bounds in computational complexity , 1975, STOC.
[7] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.
[8] P. Erdoes,et al. On sparse graphs with dense long paths. , 1975 .
[9] Patrick W. Dymond,et al. Speedups of deterministic machines by synchronous parallel machines , 1983, J. Comput. Syst. Sci..
[10] Georg Schnitger. On depth-reduction and grates , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[11] Robert E. Tarjan,et al. Asymptotically tight bounds on time-space trade-offs in a pebble game , 1982, JACM.
[12] Endre Szemerédi,et al. On determinism versus non-determinism and related problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).