Skip to main content
Conference Proceedings

Hard sets and pseudo-random generators for constant depth circuits

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2001) 2245 58-69
DOI: 10.1007/3-540-45294-x_6
9Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Agrawal, M. (2001). Hard sets and pseudo-random generators for constant depth circuits. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2245, pp. 58–69). Springer Verlag. https://doi.org/10.1007/3-540-45294-x_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free