Milking the Aanderaa Argument
暂无分享,去创建一个
Janos Simon | Richard E. Newman | Joel I. Seiferas | Ramamohan Paturi | Janos Simon | J. Seiferas | R. Paturi | R. Newman
[1] Wolfgang J. Paul,et al. On-line simulation of k+1 tapes by k tapes requires nonlinear time , 1982, FOCS 1982.
[2] A. Kolmogorov. Three approaches to the quantitative definition of information , 1968 .
[3] Richard Edwin Stearns,et al. Two-Tape Simulation of Multitape Turing Machines , 1966, JACM.
[4] Wolfgang J. Paul,et al. An Information-Theoretic Approach to Time Bounds for On-Line Computation , 1981, J. Comput. Syst. Sci..
[5] Janos Simon,et al. Lower bounds on the time of probabilistic on-line simulations , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).
[6] Wolfgang J. Paul,et al. On-line simulation of k+1 tapes by k tapes requires nonlinear time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[7] M. Rabin. Real time computation , 1963 .
[8] Wolfgang J. Paul,et al. On-line simulation of k+1 tapes by k tapes requires nonlinear time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[9] Nicholas Pippenger. Probabilistic simulations (Preliminary Version) , 1982, STOC '82.
[10] L. Levin,et al. THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS , 1970 .
[11] Wolfgang J. Paul,et al. Two Nonlinear Lower Bounds for On-Line Computations , 1984, Inf. Control..
[12] Stephen A. Cook,et al. Space Lower Bounds for Maze Threadability on Restricted Machines , 1980, SIAM J. Comput..
[13] Ming Li,et al. Two decades of applied Kolmogorov complexity: in memoriam Andrei Nikolaevich Kolmogorov 1903-87 , 1988, [1988] Proceedings. Structure in Complexity Theory Third Annual Conference.