{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:37:34Z","timestamp":1725471454325},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540466499"},{"type":"electronic","value":"9783540466505"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11894841_4","type":"book-chapter","created":{"date-parts":[[2006,10,4]],"date-time":"2006-10-04T07:29:53Z","timestamp":1159946993000},"page":"13-27","source":"Crossref","is-referenced-by-count":2,"title":["Spectral Norm in Learning Theory: Some Selected Topics"],"prefix":"10.1007","author":[{"given":"Hans Ulrich","family":"Simon","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1006\/inco.1995.1042","volume":"117","author":"S. Ben-David","year":"1995","unstructured":"Ben-David, S., Itai, A., Kushilevitz, E.: Learning by distances. Information and Computation\u00a0117(2), 240\u2013250 (1995)","journal-title":"Information and Computation"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Blum, A., Furst, M., Jackson, J., Kearns, M., Mansour, Y., Rudich, S.: Weakly learning DNF and characterizing statistical query learning using Fourier analysis. In: Proceedings of the 26th Annual Symposium on Theory of Computing, pp. 253\u2013263 (1994)","DOI":"10.1145\/195058.195147"},{"issue":"4","key":"4_CR3","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1145\/792538.792543","volume":"50","author":"A. Blum","year":"2003","unstructured":"Blum, A., Kalai, A., Wasserman, H.: Noise-tolerant learning, the parity problem, and the statistical query model. Journal of the Association on Computing Machinery\u00a050(4), 506\u2013519 (2003)","journal-title":"Journal of the Association on Computing Machinery"},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1007\/3-540-68697-5_11","volume-title":"Advances in Cryptology - CRYPTO \u201996","author":"D. Boneh","year":"1996","unstructured":"Boneh, D., Venkatesan, R.: Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol.\u00a01109, pp. 129\u2013142. Springer, Heidelberg (1996)"},{"issue":"4","key":"4_CR5","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1016\/S0022-0000(02)00019-3","volume":"65","author":"J. Forster","year":"2002","unstructured":"Forster, J.: A linear lower bound on the unbounded error communication complexity. Journal of Computer and System Sciences\u00a065(4), 612\u2013625 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/3-540-45294-X_15","volume-title":"FST TCS 2001: Foundations of Software Technology and Theoretical Computer Science","author":"J. Forster","year":"2001","unstructured":"Forster, J., Krause, M., Lokam, S.V., Mubarakzjanov, R., Schmitt, N., Simon, H.U.: Relations between communication complexity, linear arrangements, and computational complexity. In: Hariharan, R., Mukund, M., Vinay, V. (eds.) FSTTCS 2001. LNCS, vol.\u00a02245, p. 171. Springer, Heidelberg (2001)"},{"issue":"6","key":"4_CR7","doi-asserted-by":"crossref","first-page":"983","DOI":"10.1145\/293347.293351","volume":"45","author":"M. Kearns","year":"1998","unstructured":"Kearns, M.: Efficient noise-tolerant learning from statistical queries. Journal of the Association on Computing Machinery\u00a045(6), 983\u20131006 (1998)","journal-title":"Journal of the Association on Computing Machinery"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Kiltz, E.: A useful primitive to prove security of every bit and about hard core predicates and universal hash functions. In: Proceedings of the 14th International Symposium on Fundamentals of Computation Theory, pp. 388\u2013392 (2001)","DOI":"10.1007\/3-540-44669-9_39"},{"key":"4_CR9","unstructured":"Kiltz, E., Simon, H.U.: Unpublished Manuscript about the Hidden Number Problem"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/j.jcss.2005.03.001","volume":"71","author":"E. Kiltz","year":"2005","unstructured":"Kiltz, E., Simon, H.U.: Threshold circuit lower bounds on cryptographic functions. Journal of Computer and System Sciences\u00a071(2), 185\u2013212 (2005)","journal-title":"Journal of Computer and System Sciences"},{"issue":"6","key":"4_CR11","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1007\/BF01204170","volume":"28","author":"M. Krause","year":"1995","unstructured":"Krause, M., Waack, S.: Variation ranks of communication matrices and lower bounds for depth two circuits having symmetric gates with unbounded fan-in. Mathematical System Theory\u00a028(6), 553\u2013564 (1995)","journal-title":"Mathematical System Theory"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/3-540-44670-2_12","volume-title":"Cryptography and Lattices","author":"P.Q. Nguy\u00ean","year":"2001","unstructured":"Nguy\u00ean, P.Q., Stern, J.: The two faces of lattices in cryptology. In: Silverman, J.H. (ed.) CaLC 2001. LNCS, vol.\u00a02146, p. 146. Springer, Heidelberg (2001)"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/0022-0000(86)90046-2","volume":"33","author":"R. Paturi","year":"1986","unstructured":"Paturi, R., Simon, J.: Probabilistic communication complexity. Journal of Computer and System Sciences\u00a033(1), 106\u2013123 (1986)","journal-title":"Journal of Computer and System Sciences"},{"issue":"11","key":"4_CR14","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L.G. Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Communications of the ACM\u00a027(11), 1134\u20131142 (1984)","journal-title":"Communications of the ACM"},{"key":"4_CR15","doi-asserted-by":"crossref","unstructured":"Vasco, M.I.G., Shparlinski, I.E.: On the security of Diffie\u2013Hellman bits. In: Proceedings of the Workshop on Cryptography and Computational Number Theory, pp. 331\u2013342 (2000)","DOI":"10.1007\/978-3-0348-8295-8_19"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-45583-3_7","volume-title":"Algorithmic Learning Theory","author":"K. Yang","year":"2001","unstructured":"Yang, K.: On learning correlated boolean functions using statistical queries (Extended abstract). In: Abe, N., Khardon, R., Zeugmann, T. (eds.) ALT 2001. LNCS, vol.\u00a02225, p. 59. Springer, Heidelberg (2001)"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/3-540-45435-7_16","volume-title":"Computational Learning Theory","author":"K. Yang","year":"2002","unstructured":"Yang, K.: New lower bounds for statistical query learning. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS, vol.\u00a02375, p. 229. Springer, Heidelberg (2002)"},{"key":"4_CR18","unstructured":"Yang, K., Blum, A.: On statistical query sampling and nmr quantum computing. In: Proceedings of the 18th Annual Conference on Computational Complexity, pp. 194\u2013208 (2003)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11894841_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:55:36Z","timestamp":1605624936000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11894841_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540466499","9783540466505"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/11894841_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}
