{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:04:28Z","timestamp":1725563068858},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153686"},{"type":"electronic","value":"9783642153693"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15369-3_30","type":"book-chapter","created":{"date-parts":[[2010,8,27]],"date-time":"2010-08-27T04:01:36Z","timestamp":1282881696000},"page":"394-405","source":"Crossref","is-referenced-by-count":7,"title":["Testing Boolean Function Isomorphism"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Blais","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"30_CR1","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/s004930070001","volume":"20","author":"N. Alon","year":"2000","unstructured":"Alon, N., Fischer, E., Krivelevich, M., Szegedy, M.: Efficient testing of large graphs. Combinatorica\u00a020(4), 451\u2013476 (2000)","journal-title":"Combinatorica"},{"key":"30_CR2","doi-asserted-by":"crossref","DOI":"10.1002\/9780470277331","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2008","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 3rd edn. Wiley, Chichester (2008)","edition":"3"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Blais, E., O\u2019Donnell, R.: Lower bounds for testing function isomorphism. In: Conference on Computational Complexity (2010)","DOI":"10.1109\/CCC.2010.30"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Garc\u00eda-Soriano, D., Matsliah, A.: Nearly tight bounds for testing function isomorphism. Manuscript (2010)","DOI":"10.1137\/1.9781611973082.130"},{"issue":"6","key":"30_CR5","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":"30_CR6","doi-asserted-by":"crossref","unstructured":"Diakonikolas, I., Lee, H.K., Matulef, K., Onak, K., Rubinfeld, R., Servedio, R.A., Wan, A.: Testing for concise representations. In: Proc. 48th Symposium on Foundations of Computer Science, pp. 549\u2013558 (2007)","DOI":"10.1109\/FOCS.2007.32"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-540-48413-4_10","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"Y. Dodis","year":"1999","unstructured":"Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved testing algorithms for monotonicity. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 97\u2013108. Springer, Heidelberg (1999)"},{"key":"30_CR8","first-page":"97","volume":"75","author":"E. Fischer","year":"2001","unstructured":"Fischer, E.: The art of uninformed decisions: a primer to property testing. Bull. Eur. Assoc. for Theoretical Comp. Sci.\u00a075, 97\u2013126 (2001)","journal-title":"Bull. Eur. Assoc. for Theoretical Comp. Sci."},{"issue":"5","key":"30_CR9","doi-asserted-by":"publisher","first-page":"1147","DOI":"10.1137\/S009753970445603","volume":"34","author":"E. Fischer","year":"2005","unstructured":"Fischer, E.: The difficulty of testing for isomorphism against a graph that is given in advance. SIAM J. on Comp.\u00a034(5), 1147\u20131158 (2005)","journal-title":"SIAM J. on Comp."},{"issue":"4","key":"30_CR10","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. J. Comput. Syst. Sci.\u00a068(4), 753\u2013787 (2004)","journal-title":"J. Comput. Syst. Sci."},{"key":"30_CR11","doi-asserted-by":"crossref","unstructured":"Fischer, E., Lehman, E., Newman, I., Raskhodnikova, S., Rubinfeld, R., Samorodnitsky, A.: Monotonicity testing over general poset domains. In: STOC 2002: Proceedings of the Thiry-Fourth Annual ACM Symposium on Theory of Computing, pp. 474\u2013483 (2002)","DOI":"10.1145\/509907.509977"},{"issue":"1","key":"30_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1137\/070680795","volume":"38","author":"E. Fischer","year":"2008","unstructured":"Fischer, E., Matsliah, A.: Testing graph isomorphism. SIAM J. Comput.\u00a038(1), 207\u2013225 (2008)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"30_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s004930070011","volume":"20","author":"O. Goldreich","year":"2000","unstructured":"Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samorodnitsky, A.: Testing monotonicity. Combinatorica\u00a020(3), 301\u2013337 (2000)","journal-title":"Combinatorica"},{"issue":"4","key":"30_CR14","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. J. ACM\u00a045(4), 653\u2013750 (1998)","journal-title":"J. ACM"},{"key":"30_CR15","unstructured":"Hajnal, A., Szemer\u00e9di, E.: Proof of a conjecture of Paul Erd\u0151s. In: Erd\u0151s, P., R\u00e9nyi, A., S\u00f3s, V.T. (eds.) Combinatorial Theory and its Applications, pp. 601\u2013623 (1969)"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Matulef, K., O\u2019Donnell, R., Rubinfeld, R., Servedio, R.A.: Testing halfspaces. In: SODA 2009: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, pp. 256\u2013264 (2009)","DOI":"10.1137\/1.9781611973068.29"},{"key":"30_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"646","DOI":"10.1007\/978-3-642-03685-9_48","volume-title":"RANDOM \u201909","author":"K. Matulef","year":"2009","unstructured":"Matulef, K., O\u2019Donnell, R., Rubinfeld, R., Servedio, R.A.: Testing \u00b1 1-weight halfspace. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) RANDOM \u201909. LNCS, vol.\u00a05687, pp. 646\u2013657. Springer, Heidelberg (2009)"},{"issue":"3","key":"30_CR18","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1561\/2200000004","volume":"1","author":"D. Ron","year":"2008","unstructured":"Ron, D.: Property testing: a learning theory perspective. Foundations and Trends in Machine Learning\u00a01(3), 307\u2013402 (2008)","journal-title":"Foundations and Trends in Machine Learning"},{"issue":"2","key":"30_CR19","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1561\/0400000029","volume":"5","author":"D. Ron","year":"2009","unstructured":"Ron, D.: Algorithmic and analysis techniques in property testing. Foundations and Trends in Theoretical Computer Science\u00a05(2), 73\u2013205 (2009)","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"issue":"2","key":"30_CR20","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1137\/S0097539793255151","volume":"25","author":"R. Rubinfeld","year":"1996","unstructured":"Rubinfeld, R., Sudan, M.: Robust characterizations of polynomials with applications to program testing. SIAM J. Comput.\u00a025(2), 252\u2013271 (1996)","journal-title":"SIAM J. Comput."},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"Yao, A.C.-C.: Probabilistic computations: Toward a unified measure of complexity. In: Proceedings of the 28th IEEE Symposium on Foundations of Computer Science, pp. 222\u2013227 (1977)","DOI":"10.1109\/SFCS.1977.24"}],"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\/978-3-642-15369-3_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:05:26Z","timestamp":1606187126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15369-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153686","9783642153693"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15369-3_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}