{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:28:08Z","timestamp":1742930888289,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319947754"},{"type":"electronic","value":"9783319947761"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-94776-1_45","type":"book-chapter","created":{"date-parts":[[2018,6,29]],"date-time":"2018-06-29T01:48:06Z","timestamp":1530236886000},"page":"542-553","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved Learning of k-Parities"],"prefix":"10.1007","author":[{"given":"Arnab","family":"Bhattacharyya","sequence":"first","affiliation":[]},{"given":"Ameet","family":"Gadekar","sequence":"additional","affiliation":[]},{"given":"Ninad","family":"Rajgopal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,29]]},"reference":[{"issue":"4","key":"45_CR1","first-page":"319","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319\u2013342 (1988)","journal-title":"Mach. Learn."},{"key":"45_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/978-3-642-03685-9_26","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"N Alon","year":"2009","unstructured":"Alon, N., Panigrahy, R., Yekhanin, S.: Deterministic approximation algorithms for the nearest codeword problem. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX\/RANDOM -2009. LNCS, vol. 5687, pp. 339\u2013351. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03685-9_26"},{"issue":"1","key":"45_CR3","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.ipl.2010.10.009","volume":"111","author":"H Buhrman","year":"2010","unstructured":"Buhrman, H., Garc\u00eda-Soriano, D., Matsliah, A.: Learning parities in the mistake-bound model. Inform. Process. Lett. 111(1), 16\u201321 (2010)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"45_CR4","doi-asserted-by":"publisher","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. J. ACM 50(4), 506\u2013519 (2003)","journal-title":"J. ACM"},{"issue":"5","key":"45_CR5","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1137\/S009753979223455X","volume":"23","author":"A Blum","year":"1994","unstructured":"Blum, A.: Separating distribution-free and mistake-bound learning models over the boolean domain. SIAM J. Comput. 23(5), 990\u20131000 (1994)","journal-title":"SIAM J. Comput."},{"key":"45_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/BFb0029575","volume-title":"Online Algorithms","author":"A Blum","year":"1998","unstructured":"Blum, A.: On-line algorithms in machine learning. In: Fiat, A., Woeginger, G.J. (eds.) Online Algorithms. LNCS, vol. 1442, pp. 306\u2013325. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/BFb0029575"},{"key":"45_CR7","doi-asserted-by":"crossref","unstructured":"Brakerski, Z., Vaikuntanathan, V.: Efficient fully homomorphic encryption from (standard) LWE. In: Proceedings of 52nd Annual IEEE Symposium on Foundations of Computer Science, pp. 97\u2013106 (2011)","DOI":"10.1109\/FOCS.2011.12"},{"issue":"2","key":"45_CR8","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., Ponnuswami, A.K.: On agnostic learning of parities, monomials, and halfspaces. SIAM J. Comput. 39(2), 606\u2013645 (2009)","journal-title":"SIAM J. Comput."},{"key":"45_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/978-3-642-24412-4_32","volume-title":"Algorithmic Learning Theory","author":"E Grigorescu","year":"2011","unstructured":"Grigorescu, E., Reyzin, L., Vempala, S.: On noise-tolerant learning of sparse parities and related problems. In: Kivinen, J., Szepesv\u00e1ri, C., Ukkonen, E., Zeugmann, T. (eds.) ALT 2011. LNCS (LNAI), vol. 6925, pp. 413\u2013424. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-24412-4_32"},{"key":"45_CR10","unstructured":"Haussler, D.: Space efficient learning algorithms. Technical report UCSC-CRL-88-2, University of California at Santa Cruz (1988)"},{"key":"45_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/3-540-45682-1_4","volume-title":"Advances in Cryptology \u2014 ASIACRYPT 2001","author":"NJ Hopper","year":"2001","unstructured":"Hopper, N.J., Blum, M.: Secure human identification protocols. In: Boyd, C. (ed.) ASIACRYPT 2001. LNCS, vol. 2248, pp. 52\u201366. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45682-1_4"},{"key":"45_CR12","first-page":"587","volume":"7","author":"AR Klivans","year":"2006","unstructured":"Klivans, A.R., Servedio, R.A.: Toward attribute efficient learning of decision lists and parities. J. Mach. Learn. Res. 7, 587\u2013602 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"45_CR13","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/B978-0-08-094829-4.50022-2","volume-title":"Proceedings of the Second Annual Workshop on Computational Learning Theory","author":"Nick Littlestone","year":"1989","unstructured":"Littlestone, N.: From on-line to batch learning. In: Proceedings of 2nd Annual ACM Workshop on Computational Learning Theory, pp. 269\u2013284 (1989)"},{"issue":"6","key":"45_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009)","journal-title":"J. ACM"},{"issue":"11","key":"45_CR15","first-page":"1134","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Comm. Assoc. Comp. Mach. 27(11), 1134\u20131142 (1984)","journal-title":"Comm. Assoc. Comp. Mach."},{"key":"45_CR16","doi-asserted-by":"crossref","unstructured":"Valiant, G.: Finding correlations in subquadratic time, with applications to learning parities and juntas. In: Proceedings of 53rd Annual IEEE Symposium on Foundations of Computer Science, pp. 11\u201320. IEEE (2012)","DOI":"10.1109\/FOCS.2012.27"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94776-1_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T16:36:29Z","timestamp":1710347789000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-94776-1_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319947754","9783319947761"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-94776-1_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"29 June 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Qing Dao","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon2018.sdu.edu.cn\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}