Pseudorandom Number Generation and Space Complexity
暂无分享,去创建一个
[1] Leslie G. Valiant,et al. On Time Versus Space , 1977, JACM.
[2] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[3] Neil D. Jones,et al. Space-Bounded Reducibility among Combinatorial Problems , 1975, J. Comput. Syst. Sci..
[4] John Gill,et al. Computational Complexity of Probabilistic Turing Machines , 1977, SIAM J. Comput..
[5] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..
[6] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .
[7] Leonard M. Adleman,et al. Two theorems on random polynomial time , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).
[8] Manuel Blum,et al. How to Generate Cryptographically Strong Sequences of Pseudo Random Bits , 1982, FOCS.
[9] L. Csanky,et al. Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..
[10] John E. Savage,et al. The Complexity of Computing , 1976 .
[11] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).