Abstract
It is shown that the existence of a set in E that is hard for constant depth circuits of subexponentialsize is equivalent to the existence of a true pseudo-random generator against constant depth circuits.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3(4):307–318, 1993.
M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13:850–864, 1984.
O. Goldreich and L. A. Levin. A hardcore predicate for all one-way functions. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 25–32, 1989.
J. Hastad. Computational limitations on small depth circuits. PhD thesis, Massachusetts Institute of Technology, 1986.
R. Impagliazzo. Hard-core distributions for somewhat hard problems. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science, pages 538–545, 1995.
R. Impagliazzo and A. Wigderson. P = BPP if E requires exponential circuits: Derandomizing the XOR lemma. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 220–229, 1997.
R. M. Karp and M. Luby. Monte-Carlo algorithms foe enumeration and reliability problems. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science, pages 56–64, 1983.
N. Nisan. Pseudo random bits for constant depth circuits. Combinatorica, 11(1):63–70, 1991.
N. Nisan and A. Wigderson. Hardness vs. randomness. J.Comput.Sys. Sci., 49(2):149–167, 1994.
M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. In Proceedings of Annual ACM Symposium on the Theory of Computing, pages 537–546, 1999.
A. C. Yao. Theory and applications of trapdoor functions. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science, pages 80–91, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Agrawal, M. (2001). Hard Sets and Pseudo-random Generators for Constant Depth Circuits. In: Hariharan, R., Vinay, V., Mukund, M. (eds) FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2001. Lecture Notes in Computer Science, vol 2245. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45294-X_6
Download citation
DOI: https://doi.org/10.1007/3-540-45294-X_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43002-5
Online ISBN: 978-3-540-45294-2
eBook Packages: Springer Book Archive