{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T04:55:02Z","timestamp":1725512102159},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540792277"},{"type":"electronic","value":"9783540792284"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-79228-4_8","type":"book-chapter","created":{"date-parts":[[2008,4,29]],"date-time":"2008-04-29T05:07:56Z","timestamp":1209445676000},"page":"94-104","source":"Crossref","is-referenced-by-count":0,"title":["Indistinguishability and First-Order Logic"],"prefix":"10.1007","author":[{"given":"Skip","family":"Jordan","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Zeugmann","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/S0097539794270236","volume":"26","author":"E. Allender","year":"1997","unstructured":"Allender, E., Balc\u00e1zar, J.L., Immerman, N.: A first-order isomorphism theorem. SIAM J. Comput.\u00a026(2), 539\u2013556 (1997)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"8_CR2","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":"8_CR3","first-page":"251","volume-title":"STOC 2006: Proceedings of the 38th Annual ACM Symposium on Theory of Computing","author":"N. Alon","year":"2006","unstructured":"Alon, N., Fischer, E., Newman, I., Shapira, A.: A combinatorial characterization of the testable graph properties: It\u2019s all about regularity. In: STOC 2006: Proceedings of the 38th Annual ACM Symposium on Theory of Computing, pp. 251\u2013260. ACM, New York, NY, USA (2006)"},{"issue":"6","key":"8_CR4","doi-asserted-by":"publisher","first-page":"1842","DOI":"10.1137\/S0097539700366528","volume":"30","author":"N. Alon","year":"2001","unstructured":"Alon, N., Krivelevich, M., Newman, I., Szegedy, M.: Regular languages are testable with a constant number of queries. SIAM J. Comput.\u00a030(6), 1842\u20131862 (2001)","journal-title":"SIAM J. Comput."},{"key":"8_CR5","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1109\/SFCS.2005.5","volume-title":"Proceedings, 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005","author":"N. Alon","year":"2005","unstructured":"Alon, N., Shapira, A.: A characterization of the (natural) graph properties testable with one-sided error. In: Proceedings, 46th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2005, pp. 429\u2013438. IEEE Computer Society Press, Los Alamitos (2005)"},{"issue":"3","key":"8_CR6","doi-asserted-by":"publisher","first-page":"274","DOI":"10.1016\/0022-0000(90)90022-D","volume":"41","author":"D.A.M. Barrington","year":"1990","unstructured":"Barrington, D.A.M., Immerman, N., Straubing, H.: On uniformity within NC1. J. of Comput. Syst. Sci.\u00a041(3), 274\u2013306 (1990)","journal-title":"J. of Comput. Syst. Sci."},{"issue":"3","key":"8_CR7","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1016\/0022-0000(93)90044-W","volume":"47","author":"M. Blum","year":"1993","unstructured":"Blum, M., Luby, M., Rubinfeld, R.: Self-testing\/correcting with applications to numerical problems. J. of Comput. Syst. Sci.\u00a047(3), 549\u2013595 (1993)","journal-title":"J. of Comput. Syst. Sci."},{"issue":"1-3","key":"8_CR8","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/j.tcs.2004.08.004","volume":"329","author":"H. Chockler","year":"2004","unstructured":"Chockler, H., Kupferman, O.: \u03c9-regular languages are testable with a constant number of queries. Theoret. Comput. Sci.\u00a0329(1-3), 71\u201392 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"8_CR9","volume-title":"A Mathematical Introduction to Logic","author":"H.B. Enderton","year":"2000","unstructured":"Enderton, H.B.: A Mathematical Introduction to Logic, 2nd edn. Academic Press, London (2000)","edition":"2"},{"key":"8_CR10","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Karp, R.M. (ed.) Complexity of Computation, SIAM-AMS Proceedings, vol.\u00a0VII, Amer. Mathematical Soc., pp. 43\u201373 (1974)"},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1006\/inco.1995.1100","volume":"120","author":"R. Fagin","year":"1995","unstructured":"Fagin, R., Stockmeyer, L.J., Vardi, M.Y.: On monadic NP vs. monadic co-NP. Inform. Comput.\u00a0120(1), 78\u201392 (1995)","journal-title":"Inform. Comput."},{"key":"#cr-split#-8_CR12.1","unstructured":"Fischer, E.: The art of uninformed decisions. Bulletin of the European Association for Theoretical Computer Science??75(97) (October 2001);"},{"key":"#cr-split#-8_CR12.2","unstructured":"Columns: Computational Complexity"},{"issue":"3","key":"8_CR13","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1002\/rsa.20037","volume":"26","author":"E. Fischer","year":"2005","unstructured":"Fischer, E.: Testing graphs for colorability properties. Random Struct. Algorithms\u00a026(3), 289\u2013309 (2005)","journal-title":"Random Struct. Algorithms"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/3-540-09526-8_5","volume-title":"Mathematical Foundations of Computer Science 1979","author":"R. Freivalds","year":"1979","unstructured":"Freivalds, R.: Fast probabilistic algorithms. In: Becvar, J. (ed.) MFCS 1979. LNCS, vol.\u00a074, pp. 57\u201369. Springer, Heidelberg (1979)"},{"issue":"1","key":"8_CR15","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/BF01744431","volume":"17","author":"M.L. Furst","year":"1984","unstructured":"Furst, M.L., Saxe, J.B., Sipser, M.: Parity, circuits, and the polynomial-time hierarchy. Mathematical Systems Theory\u00a017(1), 13\u201327 (1984)","journal-title":"Mathematical Systems Theory"},{"issue":"4","key":"8_CR16","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"},{"issue":"1","key":"8_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/rsa.10078","volume":"23","author":"O. Goldreich","year":"2003","unstructured":"Goldreich, O., Trevisan, L.: Three theorems regarding testing graph properties. Random Struct. Algorithms\u00a023(1), 23\u201357 (2003)","journal-title":"Random Struct. Algorithms"},{"key":"8_CR18","doi-asserted-by":"publisher","first-page":"285","DOI":"10.2307\/1994208","volume":"117","author":"J. Hartmanis","year":"1965","unstructured":"Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. Transactions of the American Mathematical Society\u00a0117, 285\u2013306 (1965)","journal-title":"Transactions of the American Mathematical Society"},{"key":"8_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-27903-2","volume-title":"Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms","author":"J. Hromkovi\u010d","year":"2005","unstructured":"Hromkovi\u010d, J.: Design and Analysis of Randomized Algorithms: Introduction to Design Paradigms. Springer, Heidelberg (2005)"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1145\/1250790.1250862","volume-title":"STOC 2007: Proceedings of the 39th Annual ACM Symposium on Theory of Computing","author":"V. R\u00f6dl","year":"2007","unstructured":"R\u00f6dl, V., Schacht, M.: Property testing in hypergraphs and the removal lemma. In: STOC 2007: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 488\u2013495. ACM, New York, NY, USA (2007)"},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1007\/978-1-4615-0013-1_15","volume-title":"Handbook of Randomized Computing","author":"D. Ron","year":"2001","unstructured":"Ron, D.: Property testing ch. 15. In: Rajasekaran, S., Pardalos, P.M., Reif, J.H., Rolim, J. (eds.) Handbook of Randomized Computing, vol.\u00a0II, ch. 15, pp. 597\u2013649. Kluwer Academic Publishers, Dordrecht (2001)"},{"issue":"2","key":"8_CR22","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."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-79228-4_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:14:29Z","timestamp":1619522069000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-79228-4_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540792277","9783540792284"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-79228-4_8","relation":{},"subject":[]}}