{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,20]],"date-time":"2026-09-20T09:37:22Z","timestamp":1789897042838,"version":"4.0.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,5,17]],"date-time":"2008-05-17T00:00:00Z","timestamp":1210982400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,5,17]]},"DOI":"10.1145\/1374376.1374465","type":"proceedings-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T16:50:20Z","timestamp":1211993420000},"page":"619-628","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Evolvability from learning algorithms"],"prefix":"10.1145","author":[{"given":"Vitaly","family":"Feldman","sequence":"first","affiliation":[{"name":"IBM Almaden Research Center, San Jose, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,5,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1558"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(92)90019-F"},{"issue":"1","key":"e_1_3_2_1_3_1","first-page":"35","article-title":"A polynomial time algorithm for learning noisy linear threshold functions","volume":"22","author":"Blum A.","year":"1997","unstructured":"A. Blum , A. Frieze , R. Kannan , and S. Vempala . A polynomial time algorithm for learning noisy linear threshold functions . Algorithmica , 22 ( 1\/2 ): 35 -- 52 , 1997 . A. Blum, A. Frieze, R. Kannan, and S. Vempala. A polynomial time algorithm for learning noisy linear threshold functions. Algorithmica, 22(1\/2):35--52, 1997.","journal-title":"Algorithmica"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/195058.195147"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792543"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1162\/153244302760200669"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.18"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/180139.181176"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007404"},{"key":"e_1_3_2_1_10_1","article-title":"Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions","author":"Feldman V.","year":"2007","unstructured":"V. Feldman . Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions . Journal of Machine Learning Research, (8):1431--1460 , 2007 . V. Feldman. Attribute Efficient and Non-adaptive Learning of Parities and DNF Expressions. Journal of Machine Learning Research, (8):1431--1460, 2007.","journal-title":"Journal of Machine Learning Research, (8):1431--1460"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1995.1136"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200426"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(93)90001-D"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/523986.857977"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/293347.293351"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/200548"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776420_26"},{"key":"e_1_3_2_1_19_1","volume-title":"Communication Complexity","author":"Kushilevitz E.","year":"1997","unstructured":"E. Kushilevitz and N. Nisan . Communication Complexity . Cambridge University Press , 1997 . E. Kushilevitz and N. Nisan. Communication Complexity. Cambridge University Press, 1997."},{"key":"e_1_3_2_1_20_1","volume-title":"Manuscript","author":"Michael L.","year":"2007","unstructured":"L. Michael . Evolving decision lists . Manuscript , 2007 . L. Michael. Evolving decision lists. Manuscript, 2007."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1022607331053"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/CCC.2007.11"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"e_1_3_2_1_24_1","volume-title":"Electronic Colloquium on Computational Complexity (ECCC), 6(120)","author":"Valiant L. G.","year":"2006","unstructured":"L. G. Valiant . Evolvability. Electronic Colloquium on Computational Complexity (ECCC), 6(120) , 2006 . L. G. Valiant. Evolvability. Electronic Colloquium on Computational Complexity (ECCC), 6(120), 2006."},{"key":"e_1_3_2_1_25_1","first-page":"22","volume-title":"Evolvability. In Proceedings of 32nd International Symposium on Mathematical Foundations of Computer Science","author":"Valiant L. G.","year":"2007","unstructured":"L. G. Valiant . Evolvability. In Proceedings of 32nd International Symposium on Mathematical Foundations of Computer Science , pages 22 -- 43 , 2007 . L. G. Valiant. Evolvability. In Proceedings of 32nd International Symposium on Mathematical Foundations of Computer Science, pages 22--43, 2007."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2004.10.003"}],"event":{"name":"STOC '08: Symposium on Theory of Computing","location":"Victoria British Columbia Canada","acronym":"STOC '08","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the fortieth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374465","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1374376.1374465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:49Z","timestamp":1750255069000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1374376.1374465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,5,17]]},"references-count":26,"alternative-id":["10.1145\/1374376.1374465","10.1145\/1374376"],"URL":"https:\/\/doi.org\/10.1145\/1374376.1374465","relation":{},"subject":[],"published":{"date-parts":[[2008,5,17]]},"assertion":[{"value":"2008-05-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}