Non-uniform Depth of Polynomial Time and Space Simulations
暂无分享,去创建一个
[1] Aravind Srinivasan,et al. Explicit OR-dispersers with polylogarithmic degree , 1998, JACM.
[2] Robert E. Tarjan,et al. Space bounds for a game on graphs , 1976, STOC '76.
[3] Michael Sipser,et al. Expanders, Randomness, or Time versus Space , 1988, Journal of computer and system sciences (Print).
[4] Endre Szemerédi,et al. On determinism versus non-determinism and related problems , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[5] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.
[6] Leslie G. Valiant,et al. Circuit Size is Nonlinear in Depth , 1976, Theor. Comput. Sci..
[7] Allan Borodin,et al. On Relating Time and Space to Size and Depth , 1977, SIAM J. Comput..
[8] Michael J. Fischer,et al. Relations Among Complexity Measures , 1979, JACM.
[9] Michael Sipser,et al. Expanders, Randomness, or Time versus Space , 1988, J. Comput. Syst. Sci..
[10] Wolfgang J. Paul,et al. On Time versus Space II. (Turing Machines) , 1981, J. Comput. Syst. Sci..
[11] Patrick W. Dymond,et al. Speedups of Deterministic Machines by Synchronous Parallel Machines , 1985, J. Comput. Syst. Sci..