{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:53:54Z","timestamp":1781078034634,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540327554","type":"print"},{"value":"9783540327561","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11682462_52","type":"book-chapter","created":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T11:50:30Z","timestamp":1140177030000},"page":"556-568","source":"Crossref","is-referenced-by-count":4,"title":["Hardness Amplification Via Space-Efficient Direct Products"],"prefix":"10.1007","author":[{"given":"Venkatesan","family":"Guruswami","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Valentine","family":"Kabanets","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"52_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/18.119713","volume":"38","author":"N. Alon","year":"1992","unstructured":"Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.: Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory\u00a038, 509\u2013516 (1992)","journal-title":"IEEE Transactions on Information Theory"},{"key":"52_CR2","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF01275486","volume":"3","author":"L. Babai","year":"1993","unstructured":"Babai, L., Fortnow, L., Nisan, N., Wigderson, A.: BPP has subexponential time simulations unless EXPTIME has publishable proofs. Computational Complexity\u00a03, 307\u2013318 (1993)","journal-title":"Computational Complexity"},{"key":"52_CR3","doi-asserted-by":"crossref","unstructured":"Capalbo, M.R., Reingold, O., Vadhan, S., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 659\u2013668 (2002)","DOI":"10.1145\/509907.510003"},{"key":"52_CR4","doi-asserted-by":"crossref","unstructured":"Dinur, I.: The PCP theorem by gap amplification. Electronic Colloquium on Computational Complexity, TR05-046 (2005)","DOI":"10.1145\/1132516.1132553"},{"key":"52_CR5","unstructured":"Goldreich, O., Nisan, N., Wigderson, A.: On Yao\u2019s XOR-Lemma. Electronic Colloquium on Computational Complexity, TR95-050 (1995)"},{"key":"52_CR6","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Indyk, P.: Expander-based constructions of efficiently decodable codes. In: Proceedings of the Forty-Second Annual IEEE Symposium on Foundations of Computer Science, pp. 658\u2013667 (2001)","DOI":"10.1109\/SFCS.2001.959942"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Indyk, P.: Near-optimal linear-time codes for unique decoding and new list-decodable codes over smaller alphabets. In: Proceedings of the Thirty-Fourth Annual ACM Symposium on Theory of Computing, pp. 812\u2013821 (2002)","DOI":"10.1145\/509907.510023"},{"key":"52_CR8","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Indyk, P.: Linear-time encodable and list decodable codes. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, pp. 126\u2013135 (2003)","DOI":"10.1145\/780542.780562"},{"key":"52_CR9","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: Proceedings of the Thirty-Sixth Annual IEEE Symposium on Foundations of Computer Science, pp. 538\u2013545 (1995)","DOI":"10.1109\/SFCS.1995.492584"},{"key":"52_CR10","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Wigderson, A.: P=BPP if E requires exponential circuits: Derandomizing the XOR Lemma. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 220\u2013229 (1997)","DOI":"10.1145\/258533.258590"},{"issue":"4","key":"52_CR11","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/BF02579323","volume":"7","author":"L.A. Levin","year":"1987","unstructured":"Levin, L.A.: One-way functions and pseudorandom generators. Combinatorica\u00a07(4), 357\u2013363 (1987)","journal-title":"Combinatorica"},{"key":"52_CR12","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0022-0000(05)80043-1","volume":"49","author":"N. Nisan","year":"1994","unstructured":"Nisan, N., Wigderson, A.: Hardness vs. randomness. Journal of Computer and System Sciences\u00a049, 149\u2013167 (1994)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"52_CR13","doi-asserted-by":"publisher","first-page":"157","DOI":"10.2307\/3062153","volume":"155","author":"O. Reingold","year":"2002","unstructured":"Reingold, O., Vadhan, S., Wigderson, A.: Entropy waves, the zig-zag graph product, and new constant-degree expanders. Annals of Mathematics\u00a0155(1), 157\u2013187 (2002)","journal-title":"Annals of Mathematics"},{"issue":"6","key":"52_CR14","doi-asserted-by":"publisher","first-page":"1723","DOI":"10.1109\/18.556668","volume":"42","author":"D.A. Spielman","year":"1996","unstructured":"Spielman, D.A.: Linear-time encodable and decodable error-correcting codes. IEEE Transactions on Information Theory\u00a042(6), 1723\u20131732 (1996)","journal-title":"IEEE Transactions on Information Theory"},{"key":"52_CR15","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: List-decoding using the XOR lemma. In: Proceedings of the Forty-Fourth Annual IEEE Symposium on Foundations of Computer Science, pp. 126\u2013135 (2003)","DOI":"10.1109\/SFCS.2003.1238187"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Theory and applications of trapdoor functions. In: Proceedings of the Twenty-Third Annual IEEE Symposium on Foundations of Computer Science, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"}],"container-title":["Lecture Notes in Computer Science","LATIN 2006: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11682462_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T00:18:27Z","timestamp":1555460307000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11682462_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540327554","9783540327561"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11682462_52","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}