{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T22:56:37Z","timestamp":1730328997266,"version":"3.28.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,6,9]]},"DOI":"10.1145\/780542.780574","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T17:18:43Z","timestamp":1082395123000},"page":"206-212","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Learning juntas"],"prefix":"10.1145","author":[{"given":"Elchanan","family":"Mossel","sequence":"first","affiliation":[{"name":"U.C. Berkeley, Berkeley, CA"}]},{"given":"Ryan","family":"O'Donnell","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}]},{"given":"Rocco P.","family":"Servedio","sequence":"additional","affiliation":[{"name":"Columbia University, New York, NY"}]}],"member":"320","published-online":{"date-parts":[[2003,6,9]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1162\/153244302760200669"},{"key":"e_1_3_2_1_2_1","first-page":"2","article-title":"On a hierarchy of boolean functions hard to compute in constant depth","volume":"4","author":"Bernasconi A.","year":"2001","unstructured":"A. Bernasconi . On a hierarchy of boolean functions hard to compute in constant depth . Discrete Mathematics & Theoretical Computer Science , 4 : 2 :79--90, 2001 .]] A. Bernasconi. On a hierarchy of boolean functions hard to compute in constant depth. Discrete Mathematics & Theoretical Computer Science, 4:2:79--90, 2001.]]","journal-title":"Discrete Mathematics & Theoretical Computer Science"},{"key":"e_1_3_2_1_3_1","volume-title":"AAAI Fall Symposium on `Relevance'","author":"Blum A.","year":"1994","unstructured":"A. Blum . Relevant examples and relevant features: Thoughts from computational learning theory . In AAAI Fall Symposium on `Relevance' , 1994 .]] A. Blum. Relevant examples and relevant features: Thoughts from computational learning theory. In AAAI Fall Symposium on `Relevance', 1994.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1016\/S0004-3702(97)00063-5"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1016\/0020-0190(87)90114-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1145\/307400.307472"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/28395.28396"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.5555\/645413.757577"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1137\/0221019"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1006\/jcss.1997.1533"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/509907.510018"},{"key":"e_1_3_2_1_12_1","volume-title":"Personal communication","author":"Kalai A.","year":"2001","unstructured":"A. Kalai and Y. Mansour . Personal communication ., 2001 .]] A. Kalai and Y. Mansour. Personal communication., 2001.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1145\/293347.293351"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1006\/inco.1994.1024"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1145\/174130.174138"},{"key":"e_1_3_2_1_16_1","first-page":"391","volume-title":"Learning Boolean functions via the Fourier transform","author":"Mansour Y.","year":"1994","unstructured":"Y. Mansour . Learning Boolean functions via the Fourier transform , pages 391 -- 424 . 1994 .]] Y. Mansour. Learning Boolean functions via the Fourier transform, pages 391--424. 1994.]]"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1006\/jcss.1995.1043"},{"unstructured":"Y. Mansour. Personal communication. 2001.]] Y. Mansour. Personal communication. 2001.]]","key":"e_1_3_2_1_18_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1145\/1968.1972"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.5555\/92571.92659"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.5555\/647716.735742"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1007\/BF01215917"}],"event":{"sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"acronym":"STOC03","name":"STOC03: The 35th Annual ACM Symposium on Theory of Computing","location":"San Diego CA USA"},"container-title":["Proceedings of the thirty-fifth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/780542.780574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T05:33:42Z","timestamp":1672983222000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/780542.780574"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6,9]]},"references-count":22,"alternative-id":["10.1145\/780542.780574","10.1145\/780542"],"URL":"https:\/\/doi.org\/10.1145\/780542.780574","relation":{},"subject":[],"published":{"date-parts":[[2003,6,9]]},"assertion":[{"value":"2003-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}