{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:19:16Z","timestamp":1725567556755},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642163661"},{"type":"electronic","value":"9783642163678"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-16367-8_11","type":"book-chapter","created":{"date-parts":[[2010,10,7]],"date-time":"2010-10-07T11:25:55Z","timestamp":1286450755000},"page":"197-210","source":"Crossref","is-referenced-by-count":6,"title":["Testing by Implicit Learning: A Brief Survey"],"prefix":"10.1007","author":[{"given":"Rocco A.","family":"Servedio","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.: Occam\u2019s razor. Information Processing Letters\u00a024, 377\u2013380 (1987)","journal-title":"Information Processing Letters"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Blais, E.: Testing juntas nearly optimally. In: Proc. 41st Annual ACM Symposium on Theory of Computing (STOC), pp. 151\u2013158 (2009)","DOI":"10.1145\/1536414.1536437"},{"issue":"6","key":"11_CR3","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1016\/j.ipl.2004.01.023","volume":"90","author":"H. Chockler","year":"2004","unstructured":"Chockler, H., Gutfreund, D.: A lower bound for testing juntas. Information Processing Letters\u00a090(6), 301\u2013305 (2004)","journal-title":"Information Processing Letters"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Diakonikolas, I., Lee, H., Matulef, K., Onak, K., Rubinfeld, R., Servedio, R., Wan, A.: Testing for concise representations. In: Proc. 48th Ann. Symposium on Computer Science (FOCS), pp. 549\u2013558 (2007)","DOI":"10.1109\/FOCS.2007.32"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-70575-8_41","volume-title":"Automata, Languages and Programming","author":"I. Diakonikolas","year":"2008","unstructured":"Diakonikolas, I., Lee, H., Matulef, K., Servedio, R., Wan, A.: Efficiently testing sparse GF(2) polynomials. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 502\u2013514. Springer, Heidelberg (2008)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Feldman, V., Gopalan, P., Khot, S., Ponnuswami, A.: New results for learning noisy parities and halfspaces. In: Proc. 47th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 563\u2013576 (2006)","DOI":"10.1109\/FOCS.2006.51"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"753","DOI":"10.1016\/j.jcss.2003.11.004","volume":"68","author":"E. Fischer","year":"2004","unstructured":"Fischer, E., Kindler, G., Ron, D., Safra, S., Samorodnitsky, A.: Testing juntas. Journal of Computer & System Sciences\u00a068, 753\u2013787 (2004)","journal-title":"Journal of Computer & System Sciences"},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. Journal of the ACM\u00a045, 653\u2013750 (1998)","journal-title":"Journal of the ACM"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1007\/978-3-642-02927-1_42","volume-title":"Automata, Languages and Programming","author":"P. Gopalan","year":"2009","unstructured":"Gopalan, P., O\u2019Donnell, R., Servedio, R., Shpilka, A., Wimmer, K.: Testing Fourier dimensionality and sparsity. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555, pp. 500\u2013512. Springer, Heidelberg (2009)"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1137\/S0895480101407444","volume":"16","author":"M. Parnas","year":"2002","unstructured":"Parnas, M., Ron, D., Samorodnitsky, A.: Testing basic boolean formulae. SIAM J. Disc. Math.\u00a016, 20\u201346 (2002)","journal-title":"SIAM J. Disc. Math."},{"issue":"2","key":"11_CR11","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1006\/jcss.1996.0017","volume":"52","author":"R. Schapire","year":"1996","unstructured":"Schapire, R., Sellie, L.: Learning sparse multivariate polynomials over a field with queries and counterexamples. J. Comput. & Syst. Sci.\u00a052(2), 201\u2013213 (1996)","journal-title":"J. Comput. & Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","Property Testing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16367-8_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T10:39:25Z","timestamp":1553164765000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16367-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642163661","9783642163678"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16367-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}