{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T20:52:12Z","timestamp":1794516732999,"version":"4.9.1"},"publisher-location":"New York, NY","reference-count":19,"publisher":"Springer New York","isbn-type":[{"value":"9781493928637","type":"print"},{"value":"9781493928644","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-1-4939-2864-4_177","type":"book-chapter","created":{"date-parts":[[2016,4,21]],"date-time":"2016-04-21T20:03:35Z","timestamp":1461269015000},"page":"897-900","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Hardness of Proper Learning"],"prefix":"10.1007","author":[{"given":"Vitaly","family":"Feldman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,4,22]]},"reference":[{"issue":"1","key":"177_CR818","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jcss.2007.04.011","volume":"74","author":"M Alekhnovich","year":"2008","unstructured":"Alekhnovich M, Braverman M, Feldman V, Klivans A, Pitassi T (2008) The complexity of properly learning simple classes. J Comput Syst Sci 74(1):16\u201334","journal-title":"J Comput Syst Sci"},{"issue":"3","key":"177_CR819","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1016\/S0022-0000(03)00038-2","volume":"66","author":"S Ben-David","year":"2003","unstructured":"Ben-David S, Eiron N, Long PM (2003) On the difficulty of approximately maximizing agreements. J Comput Syst Sci 66(3):496\u2013514","journal-title":"J Comput Syst Sci"},{"issue":"1","key":"177_CR820","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0893-6080(05)80010-3","volume":"5","author":"AL Blum","year":"1992","unstructured":"Blum AL, Rivest RL (1992) Training a 3-node neural network is NP-complete. Neural Netw 5(1):117\u2013127","journal-title":"Neural Netw"},{"issue":"4","key":"177_CR821","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A Blumer","year":"1989","unstructured":"Blumer A, Ehrenfeucht A, Haussler D, Warmuth M (1989) Learnability and the Vapnik-Chervonenkis dimension. J ACM 36(4):929\u2013965","journal-title":"J ACM"},{"issue":"1","key":"177_CR822","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1006\/inco.1995.1164","volume":"123","author":"N Bshouty","year":"1995","unstructured":"Bshouty N (1995) Exact learning via the monotone theory. Inform Comput 123(1):146\u2013153","journal-title":"Inform Comput"},{"issue":"2","key":"177_CR823","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/070684914","volume":"39","author":"V Feldman","year":"2009","unstructured":"Feldman V, Gopalan P, Khot S, Ponuswami A (2009) On agnostic learning of parities, monomials and halfspaces. SIAM J Comput 39(2):606\u2013645","journal-title":"SIAM J Comput"},{"issue":"1","key":"177_CR824","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.jcss.2008.07.007","volume":"75","author":"V Feldman","year":"2009","unstructured":"Feldman V (2009) Hardness of approximate two-level logic minimization and pac learning with membership queries. J Comput Syst Sci 75(1):13\u201326","journal-title":"J Comput Syst Sci"},{"issue":"6","key":"177_CR825","doi-asserted-by":"publisher","first-page":"1558","DOI":"10.1137\/120865094","volume":"41","author":"V Feldman","year":"2012","unstructured":"Feldman V, Guruswami V, Raghavendra P, Wu Y (2012) Agnostic learning of monomials by halfspaces is hard. SIAM J Comput 41(6):1558\u20131590","journal-title":"SIAM J Comput"},{"key":"177_CR826","volume-title":"Computers and intractability","author":"M Garey","year":"1979","unstructured":"Garey M, Johnson DS (1979) Computers and intractability. W.H. Freeman, San Francisco"},{"issue":"2","key":"177_CR827","doi-asserted-by":"publisher","first-page":"742","DOI":"10.1137\/070685798","volume":"39","author":"V Guruswami","year":"2009","unstructured":"Guruswami V, Raghavendra P (2009) Hardness of learning halfspaces with noise. SIAM J Comput 39(2):742\u2013765","journal-title":"SIAM J Comput"},{"key":"177_CR828","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/3-540-59042-0_102","volume-title":"STACS 95: 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich","author":"T Hancock","year":"1995","unstructured":"Hancock T, Jiang T, Li M, Tromp J (1995) Lower bounds on learning decision lists and trees. In: Mayr EW, Puech C (eds) STACS 95: 12th Annual Symposium on Theoretical Aspects of Computer Science, Munich, pp\u00a0527\u2013538. Springer, Berlin\/Heidelberg"},{"issue":"1","key":"177_CR829","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/0890-5401(92)90010-D","volume":"100","author":"D Haussler","year":"1992","unstructured":"Haussler D (1992) Decision theoretic generalizations of the PAC model for neural net and other learning applications. Inform Comput 100(1):78\u2013150","journal-title":"Inform Comput"},{"key":"177_CR830","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1006\/jcss.1997.1533","volume":"55","author":"J Jackson","year":"1997","unstructured":"Jackson J (1997) An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. J Comput Syst Sci 55:414\u2013440","journal-title":"J Comput Syst Sci"},{"issue":"2\u20133","key":"177_CR831","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1023\/A:1022615600103","volume":"17","author":"M Kearns","year":"1994","unstructured":"Kearns M, Schapire R, Sellie L (1994) Toward efficient agnostic learning. Mach Learn 17(2\u20133):115\u2013141","journal-title":"Mach Learn"},{"issue":"1","key":"177_CR832","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M Kearns","year":"1994","unstructured":"Kearns M, Valiant L (1994) Cryptographic limitations on learning boolean formulae and finite automata. J ACM 41(1):67\u201395","journal-title":"J ACM"},{"key":"177_CR833","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3897.001.0001","volume-title":"An introduction to computational learning theory","author":"M Kearns","year":"1994","unstructured":"Kearns M, Vazirani U (1994) An introduction to computational learning theory. MIT, Cambridge"},{"issue":"1","key":"177_CR834","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.jcss.2010.06.010","volume":"77","author":"S Khot","year":"2011","unstructured":"Khot S, Saket R (2011) On the hardness of learning intersections of two halfspaces. J Comput Syst Sci 77(1):129\u2013141","journal-title":"J Comput Syst Sci"},{"issue":"4","key":"177_CR835","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L Pitt","year":"1988","unstructured":"Pitt L, Valiant L (1988) Computational limitations on learning from examples. J ACM 35(4):965\u2013984","journal-title":"J ACM"},{"issue":"11","key":"177_CR836","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant LG (1984) A theory of the learnable. Commun ACM 27(11):1134\u20131142","journal-title":"Commun ACM"}],"container-title":["Encyclopedia of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4939-2864-4_177","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,10,15]],"date-time":"2026-10-15T23:45:22Z","timestamp":1792107922000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/chapter\/10.1007\/978-1-4939-2864-4_177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9781493928637","9781493928644"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_177","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-1-4939-2864-4","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"22 April 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}