{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:04:18Z","timestamp":1775282658938,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642229527","type":"print"},{"value":"9783642229534","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22953-4_7","type":"book-chapter","created":{"date-parts":[[2011,8,17]],"date-time":"2011-08-17T08:28:08Z","timestamp":1313569688000},"page":"78-89","source":"Crossref","is-referenced-by-count":1,"title":["Computational Randomness from Generalized Hardcore Sets"],"prefix":"10.1007","author":[{"given":"Chia-Jung","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chi-Jen","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shi-Chun","family":"Tsai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"7_CR1","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1137\/S0097539701398375","volume":"32","author":"P. Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.: The non-stochastic multi-armed bandit problem. SIAM J. Comput.\u00a032(1), 48\u201377 (2002)","journal-title":"SIAM J. Comput."},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"Barak, B., Hardt, M., Kale, S.: The Uniform Hardcore Lemma via Approximate Bregman Projectionss. In: SODA 2008, pp. 1193\u20131200 (2008)","DOI":"10.1137\/1.9781611973068.129"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Barak, B., Shaltiel, R., Wigderson, A.: Computational analogues of entropy. In: Proc. APPROX-RANDOM, pp. 200\u2013215 (2003)","DOI":"10.1007\/978-3-540-45198-3_18"},{"key":"7_CR4","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley, Chichester (1991)"},{"issue":"4","key":"7_CR5","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1137\/S0895480198344540","volume":"13","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Rubinfeld, R., Sudan, M.: Learning polynomials with queries: the highly noisy case. SIAM J. Disc. Math.\u00a013(4), 535\u2013570 (2000)","journal-title":"SIAM J. Disc. Math."},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"903","DOI":"10.1137\/S0097539705447281","volume":"35","author":"A. Healy","year":"2006","unstructured":"Healy, A., Vadhan, S., Viola, E.: Using nondeterminism to amplify hardness. SIAM J. Comput.\u00a035(4), 903\u2013931 (2006)","journal-title":"SIAM J. Comput."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Holenstein, T.: Key agreement from weak bit agreement. In: STOC 2005, pp. 664\u2013673 (2005)","DOI":"10.1145\/1060590.1060689"},{"key":"7_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-72540-4_10","volume-title":"Advances in Cryptology - EUROCRYPT 2007","author":"C.-Y. Hsiao","year":"2007","unstructured":"Hsiao, C.-Y., Lu, C.-J., Reyzin, L.: Conditional computational entropy, or toward separating pseudoentropy from compressibility. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol.\u00a04515, pp. 169\u2013186. Springer, Heidelberg (2007)"},{"key":"7_CR9","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R.: Hard-core distributions for somewhat hard problems. In: FOCS 1995, pp. 538\u2013545 (1995)","DOI":"10.1109\/SFCS.1995.492584"},{"issue":"3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1023\/A:1022949332276","volume":"51","author":"A. Klivans","year":"2003","unstructured":"Klivans, A., Servedio, R.A.: Boosting and hard-core sets. Machine Learning\u00a051(3), 217\u2013238 (2003)","journal-title":"Machine Learning"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/11786986_9","volume-title":"Automata, Languages and Programming","author":"C.-J. Lee","year":"2006","unstructured":"Lee, C.-J., Lu, C.-J., Tsai, S.-C.: Deterministic extractors for independent-symbol sources. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. LNCS, vol.\u00a04051, pp. 84\u201395. Springer, Heidelberg (2006)"},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/978-3-642-02882-3_34","volume-title":"Computing and Combinatorics","author":"C.-J. Lee","year":"2009","unstructured":"Lee, C.-J., Lu, C.-J., Tsai, S.-C.: Extracting computational entropy and learning noisy linear functions. In: Ngo, H.Q. (ed.) COCOON 2009. LNCS, vol.\u00a05609, pp. 338\u2013347. Springer, Heidelberg (2009)"},{"key":"7_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-540-73420-8_18","volume-title":"Automata, Languages and Programming","author":"C.-J. Lu","year":"2007","unstructured":"Lu, C.-J., Tsai, S.-C., Wu, H.-L.: On the complexity of hard-core set constructions. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 183\u2013194. Springer, Heidelberg (2007)"},{"issue":"1","key":"7_CR14","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput.Syst. Sci.\u00a052(1), 43\u201352 (1996)","journal-title":"J. Comput. .Syst. Sci."},{"key":"7_CR15","doi-asserted-by":"crossref","unstructured":"O\u2019Donnell, R.: Hardness amplification within NP. In: STOC, pp. 751\u2013760 (2002)","DOI":"10.1145\/510014.510015"},{"key":"7_CR16","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS\u00a077, 67\u201395 (2002)","journal-title":"Bulletin of the EATCS"},{"issue":"2","key":"7_CR17","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1006\/jcss.2000.1730","volume":"62","author":"M. Sudan","year":"2001","unstructured":"Sudan, M., Trevisan, L., Vadhan, S.: Pseudorandom generators without the XOR lemma. J. Comput.Syst. Sci.\u00a062(2), 236\u2013266 (2001)","journal-title":"J. Comput. .Syst. Sci."},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: List decoding using the XOR lemma. In: FOCS, pp. 126\u2013135 (2003)","DOI":"10.1109\/SFCS.2003.1238187"},{"key":"7_CR19","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: On uniform amplification of hardness in NP. In: STOC, pp. 31\u201338 (2005)","DOI":"10.1145\/1060590.1060595"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Yao, A.: Theory and applications of trapdoor functions. In: FOCS 1982, pp. 80\u201391 (1982)","DOI":"10.1109\/SFCS.1982.45"},{"key":"7_CR21","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: General weak random sources. In: FOCS, pp. 534\u2013543 (1990)","DOI":"10.1109\/FSCS.1990.89574"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22953-4_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T23:39:46Z","timestamp":1560469186000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22953-4_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642229527","9783642229534"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22953-4_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}