{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T05:40:40Z","timestamp":1737006040308,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540424703"},{"type":"electronic","value":"9783540446668"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44666-4_30","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:58:07Z","timestamp":1178211487000},"page":"273-285","source":"Crossref","is-referenced-by-count":6,"title":["Proclaiming Dictators and Juntas or Testing Boolean Formulae"],"prefix":"10.1007","author":[{"given":"Michal","family":"Parnas","sequence":"first","affiliation":[]},{"given":"Dana","family":"Ron","sequence":"additional","affiliation":[]},{"given":"Alex","family":"Samorodnitsky","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,17]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"N. Alon, E. Fischer, M. Krivelevich, and M Szegedy. Efficient testing of large graphs. In Proceedings of FOCS, pages 645\u2013655, 1999.","DOI":"10.1109\/SFFCS.1999.814642"},{"key":"30_CR2","first-page":"319","volume":"2","author":"D. Angluin","year":"1988","unstructured":"D. Angluin. Queries and concept learning. Machine Learning, 2:319\u2013342, 1988.","journal-title":"Machine Learning"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Y. Aumann, J. H\u00e5stad, M. Rabin, and M. Sudan. Linear consistency testing. In Proceedings of RANDOM, pages 109\u2013120, 1999.","DOI":"10.1007\/978-3-540-48413-4_11"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"M. Bellare, D. Coppersmith, J. H\u00e5stad, M. Kiwi, and M. Sudan. Linearity testing in characteristic two. In Proceedings of FOCS, pages 432\u2013441, 1995.","DOI":"10.1109\/SFCS.1995.492574"},{"key":"30_CR5","first-page":"549","volume":"47","author":"M. Blum","year":"1993","unstructured":"M. Blum, M. Luby, and R. Rubinfeld. Self-testing\/correcting with applications to numerical problems. JACM, 47:549\u2013595, 1993.","journal-title":"JACM"},{"issue":"6","key":"30_CR6","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"A. Blumer, A. Ehrenfeucht, D. Haussler, and M. K. Warmuth. Occam\u2019s razor. Information Processing Letters, 24(6):377\u2013380, April 1987.","journal-title":"Information Processing Letters"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"N. Bshouty, J. Jackson, and C. Tamon. More efficient PAC-learning of DNF with membership queries under the uniform distribution. In Proceedings of COLT, pages 286\u2013295, 1999.","DOI":"10.1145\/307400.307472"},{"key":"30_CR8","doi-asserted-by":"crossref","unstructured":"Y. Dodis, O. Goldreich, E. Lehman, S. Raskhodnikova, D. Ron, and A. Samorodnitsky. Improved testing algorithms for monotonocity. In Proceedings of RANDOM, pages 97\u2013108, 1999.","DOI":"10.1007\/978-3-540-48413-4_10"},{"issue":"3","key":"30_CR9","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930070011","volume":"20","author":"O. Goldreich","year":"2000","unstructured":"O. Goldreich, S. Goldwasser, E. Lehman, D. Ron, and A. Samorodnitsky. Testing monotonicity. Combinatorica, 20(3):301\u2013337, 2000.","journal-title":"Combinatorica"},{"issue":"4","key":"30_CR10","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1145\/285055.285060","volume":"45","author":"O. Goldreich","year":"1998","unstructured":"O. Goldreich, S. Goldwasser, and D. Ron. Property testing and its connection to learning and approximation. JACM, 45(4):653\u2013750, 1998.","journal-title":"JACM"},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"O. Goldreich and D. Ron. Property testing in bounded degree graphs. In Proceedings of STOC, pages 406\u2013415, 1997. To appear in Algorithmica.","DOI":"10.1145\/258533.258627"},{"key":"30_CR12","first-page":"414","volume":"55","author":"J. Jackson","year":"1997","unstructured":"J. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. JCSS, 55:414\u2013440, 1997.","journal-title":"JCSS"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"A. Klivans and R. Servedio. Boosting and hard-core sets. In Proceedings of FOCS, pages 624\u2013633, 1999.","DOI":"10.1109\/SFFCS.1999.814638"},{"key":"30_CR14","unstructured":"M. Parnas, D. Ron, and A. Samorodnitsky. Testing boolean formulae. Available from: http:\/\/www.eng.tau.ac.il\/~danar , 2001."},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"D. Ron. Property testing. To appear in the Handbook on Randomization. Currently available from: http:\/\/www.eng.tau.ac.il\/~danar , 2000.","DOI":"10.1007\/978-1-4615-0013-1_15"},{"issue":"6","key":"30_CR16","doi-asserted-by":"publisher","first-page":"1972","DOI":"10.1137\/S0097539796298625","volume":"28","author":"R. Rubinfeld","year":"1999","unstructured":"R. Rubinfeld. Robust functional equations and their applications to program testing. SIAM Journal on Computing, 28(6):1972\u20131997, 1999.","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"30_CR17","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"R. Rubinfeld and M. Sudan. Robust characterization of polynomials with applications to program testing. SIAM Journal on Computing, 25(2):252\u2013271, 1996.","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44666-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,16]],"date-time":"2025-01-16T00:48:23Z","timestamp":1736988503000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44666-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424703","9783540446668"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/3-540-44666-4_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}