{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:42:41Z","timestamp":1725486161951},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430025"},{"type":"electronic","value":"9783540452942"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45294-x_6","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:45:12Z","timestamp":1181616312000},"page":"58-69","source":"Crossref","is-referenced-by-count":4,"title":["Hard Sets and Pseudo-random Generators for Constant Depth Circuits"],"prefix":"10.1007","author":[{"given":"Manindra","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,26]]},"reference":[{"issue":"4","key":"6_CR1","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF01275486","volume":"3","author":"L. Babai","year":"1993","unstructured":"L. Babai, L. Fortnow, N. Nisan, and A. Wigderson. BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity, 3(4):307\u2013318, 1993.","journal-title":"Computational Complexity"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1137\/0213053","volume":"13","author":"M. Blum","year":"1984","unstructured":"M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13:850\u2013864, 1984.","journal-title":"SIAM Journal on Computing"},{"key":"6_CR3","doi-asserted-by":"crossref","unstructured":"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\u201332, 1989.","DOI":"10.1145\/73007.73010"},{"key":"6_CR4","unstructured":"J. Hastad. Computational limitations on small depth circuits. PhD thesis, Massachusetts Institute of Technology, 1986."},{"key":"6_CR5","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo. Hard-core distributions for somewhat hard problems. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science, pages 538\u2013545, 1995.","DOI":"10.1109\/SFCS.1995.492584"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"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\u2013229, 1997.","DOI":"10.1145\/258533.258590"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"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\u201364, 1983.","DOI":"10.1109\/SFCS.1983.35"},{"issue":"1","key":"6_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/BF01375474","volume":"11","author":"N. Nisan","year":"1991","unstructured":"N. Nisan. Pseudo random bits for constant depth circuits. Combinatorica, 11(1):63\u201370, 1991.","journal-title":"Combinatorica"},{"issue":"2","key":"6_CR9","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N. Nisan","year":"1994","unstructured":"N. Nisan and A. Wigderson. Hardness vs. randomness. J.Comput.Sys. Sci., 49(2):149\u2013167, 1994.","journal-title":"J.Comput.Sys. Sci."},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013546, 1999.","DOI":"10.1109\/CCC.1999.766253"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"A. C. Yao. Theory and applications of trapdoor functions. In Proceedings of Annual IEEE Symposium on Foundations of Computer Science, pages 80\u201391, 1982.","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45294-X_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T01:27:49Z","timestamp":1556501269000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45294-X_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430025","9783540452942"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-45294-x_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}