De-randomizing BPP: the state of the art
暂无分享,去创建一个
[1] Manuel Blum,et al. How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[2] Andrew Chi-Chih Yao,et al. Theory and application of trapdoor functions , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[3] Dieter van Melkebeek,et al. Graph nonisomorphism has subexponential size proofs unless the polynomial-time hierarchy collapses , 1999, STOC '99.
[4] Luca Trevisan,et al. Construction of extractors using pseudo-random generators (extended abstract) , 1999, STOC '99.
[5] Noam Nisan,et al. BPP has subexponential time simulations unlessEXPTIME has publishable proofs , 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.
[6] Noam Nisan,et al. Pseudorandom bits for constant depth circuits , 1991, Comb..
[7] José D. P. Rolim,et al. Hitting Properties of Hard Boolean Operators and their Consequences on BPP , 1996, Electron. Colloquium Comput. Complex..
[8] Luca Trevisan,et al. Pseudorandom generators without the XOR Lemma , 1999, Electron. Colloquium Comput. Complex..
[9] José D. P. Rolim,et al. Hitting Sets Derandomize BPP , 1996, ICALP.
[10] Noam Nisan,et al. Hardness vs. randomness , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.
[11] Adi Shamir,et al. On the Generation of Cryptographically Strong Pseudo-Random Sequences , 1981, ICALP.
[12] Avi Wigderson,et al. Randomness vs. time: de-randomization under a uniform assumption , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).
[13] Oded Goldreich,et al. Modern Cryptography, Probabilistic Proofs and Pseudorandomness , 1998, Algorithms and Combinatorics.