Agrawal, Manindra (2001) Hard sets and pseudo-random generators for constant depth circuits Lecture Notes in Computer Science, 2245 . pp. 58-69. ISSN 0302-9743
![[img]](https://repository.ias.ac.in/style/images/fileicons/application_pdf.png)
|
PDF
- Author Version
202kB |
Official URL: http://www.springerlink.com/content/dqwfpjqx83tqt9...
Related URL: http://dx.doi.org/10.1007/3-540-45294-X_6
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.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Springer. |
| ID Code: | 92020 |
| Deposited On: | 26 May 2012 13:52 |
| Last Modified: | 19 May 2016 05:36 |
Repository Staff Only: item control page
