{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:58:41Z","timestamp":1725483521814},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_4","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T12:58:07Z","timestamp":1178197087000},"page":"7-9","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Error-Correcting Codes and Pseudorandom Projections"],"prefix":"10.1007","author":[{"given":"Luca","family":"Trevisan","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo, R. Shaltiel, and A. Wigderson. Extractors and pseudorandom generators with optimal seed length. In Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 1\u201310, 2000.","DOI":"10.1145\/335305.335306"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo and A. Wigderson. P = BPP unless E has sub-exponential circuits. In Proceedings of the 29th ACM Symposium on Theory of Computing, pages 220\u2013229, 1997.","DOI":"10.1145\/258533.258590"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"A. Klivans and D. van Milkebeek. Graph non-isomorphism has subexponen-tial size proofs unless the polynomial hierarchy collapses. In Proceedings of the 31st ACM Symposium on Theory of Computing, pages 659\u2013667, 1999.","DOI":"10.1145\/301250.301428"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"P.B. Miltersen. Error-correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries. In Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms, 1998.","DOI":"10.7146\/brics.v4i17.18813"},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"P.B. Miltersen and N.V. Vinodchandran. Derandomizing Arthur-Merlin games using hitting sets. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 71\u201380, 1999.","DOI":"10.7146\/brics.v6i47.20117"},{"key":"4_CR6","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. Journal of Computer and System Sciences, 49:149\u2013167, 1994. Preliminary version in Proc. of FOCS\u201988.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"R. Raz, O. Reingold, and S. Vadhan. Extracting all the randomness and reducing the error in Trevisan\u2019s extractors. In Proceedings of the 31st ACM Symposium on Theory of Computing, pages 149\u2013158, 1999.","DOI":"10.1145\/301250.301292"},{"issue":"2","key":"4_CR8","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/jcss.2000.1730","volume":"62","author":"M. Sudan","year":"2001","unstructured":"M. Sudan, L. Trevisan, and S. Vadhan. Pseudorandom generators without the XOR lemma. Journal of Computer and System Sciences, 62(2):236\u2013266, 2001.","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR9","doi-asserted-by":"crossref","unstructured":"L. Trevisan. Construction of extractors using pseudo-random generators. In Proceedings of the 31st ACM Symposium on Theory of Computing, pages 141\u2013148, 1999.","DOI":"10.1145\/301250.301289"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"A. Ta-Shma, C. Umans, and D. Zuckerman. Loss-less condensers, unbalanced expanders, and extractors. In Proceedings of the 33rd ACM Symposium on Theory of Computing, 2001.","DOI":"10.1145\/380752.380790"},{"key":"4_CR11","doi-asserted-by":"crossref","unstructured":"A. Ta-Shma, D. Zuckerman, and S. Safra. Extractors from Reed-Muller codes. Technical Report TR01-036, Electronic Colloquium on Computational Complexity, 2001.","DOI":"10.1109\/SFCS.2001.959940"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T09:06:29Z","timestamp":1558256789000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_4","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"17 August 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}