{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:49Z","timestamp":1759638409216},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540659228"},{"type":"electronic","value":"9783540488552"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/10703163_11","type":"book-chapter","created":{"date-parts":[[2006,10,9]],"date-time":"2006-10-09T14:15:50Z","timestamp":1160403350000},"page":"159-170","source":"Crossref","is-referenced-by-count":8,"title":["Computational Complexity of Ehrenfeucht-Fra\u00efss\u00e9 Games on Finite Structures"],"prefix":"10.1007","author":[{"given":"Elena","family":"Pezzoli","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Perspectives in Mathematical Logic","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1995","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory. Perspectives in Mathematical Logic. Springer, Berlin (1995)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Pezzoli, E.: On the computational complexity of type-two functionals and logical games on finite structures. Ph.D thesis. Stanford University, Stanford (June 1998)","DOI":"10.1007\/BFb0028026"},{"key":"11_CR3","unstructured":"Pezzoli, E.: Classical paramteric complexity of logical games (in preparation)"},{"key":"11_CR4","unstructured":"Grohe, M.: Equivalence in finite-variable logics is complete for polynomial time. In: Proceeding FOCS 1996 (1996)"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0890-5401(89)90055-2","volume":"83","author":"N. Immerman","year":"1989","unstructured":"Immerman, N., Kozen, D.: Definability with a bounded number of variables. Information and Computation\u00a083, 121\u2013139 (1989)","journal-title":"Information and Computation"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"K\u00f6bler, J., Sch\u00f6ning, U., Tor\u00e1n, J.: The Graph Isomorphism Problem. Birkh\u00e4user (1993)","DOI":"10.1007\/978-1-4612-0333-9"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time. In: Fifth Annual ACM Symposium on theory of computing, Association for Computing Machinery, New york, pp. 1\u20139 (1973)","DOI":"10.1145\/800125.804029"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10703163_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T15:28:58Z","timestamp":1558279738000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10703163_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540659228","9783540488552"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/10703163_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1999]]}}}