Deterministic amplification of space-bounded probabilistic algorithms
暂无分享,去创建一个
[1] Noam Nisan,et al. Randomness is Linear in Space , 1996, J. Comput. Syst. Sci..
[2] Noam Nisan. Extracting randomness: how and why , 1996 .
[3] Noam Nisan. Rl <= Sc , 1994, Comput. Complex..
[4] Avi Wigderson,et al. Dispersers, deterministic amplification, and weak random sources , 1989, 30th Annual Symposium on Foundations of Computer Science.
[5] Akira Maruoka,et al. Expanders obtained from affine transformations , 1985, STOC '85.
[6] Russell Impagliazzo,et al. How to recycle random bits , 1989, 30th Annual Symposium on Foundations of Computer Science.
[7] Noam Nisan,et al. Pseudorandom generators for space-bounded computation , 1992, Comb..
[8] Oded Goldreich,et al. On the power of two-point based sampling , 1989, J. Complex..
[9] Oded Goldreich,et al. A Sample of Samplers - A Computational Perspective on Sampling (survey) , 1997, Electron. Colloquium Comput. Complex..
[10] János Komlós,et al. Deterministic simulation in LOGSPACE , 1987, STOC.
[11] Zvi Galil,et al. Explicit Constructions of Linear-Sized Superconcentrators , 1981, J. Comput. Syst. Sci..
[12] Jaikumar Radhakrishnan,et al. Tight bounds for depth-two superconcentrators , 1997, Proceedings 38th Annual Symposium on Foundations of Computer Science.
[13] Noam Nisan,et al. Extracting randomness: how and why. A survey , 1996, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory).