Author:
Impagliazzo Russell,Moser Philippe
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference18 articles.
1. Power from random strings;Allender;SIAM J. Comput.,2006
2. V. Arvind, J. Köbler, On pseudorandomness and resource-bounded measure, in: Proceedings of the 17th Conference of the Foundations of Software Technology and Theoretical Computer Science, vol. 1346, 1997, pp. 235–249.
3. John M. Hitchcock, Aduri Pavan, Hardness hypotheses, derandomization, and circuit complexity, in: Kamal Lodaya, Meena Mahajan (Eds.), FSTTCS, Lecture Notes in Computer Science, vol. 3328, Springer, 2004, pp. 336–347.
4. R. Impagliazzo, P. Moser, A zero-one law for RP, in: Proceedings of the 18th Conference on Computational Complexity, 2003, pp. 48–52.
5. R. Impagliazzo, A. Widgerson, P=BPP if E requires exponential circuits: derandomizing the XOR lemma, in: Proceedings of the 29th Annual ACM Symposium on Theory of Computing, 1997, pp. 220–229.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Polylog depth, highness and lowness for E;Information and Computation;2020-04
2. A zero-one SUBEXP-dimension law for BPP;Information Processing Letters;2011-04