{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:47:09Z","timestamp":1725536829894},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642038150"},{"type":"electronic","value":"9783642038167"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-03816-7_23","type":"book-chapter","created":{"date-parts":[[2009,8,19]],"date-time":"2009-08-19T10:43:03Z","timestamp":1250678583000},"page":"258-269","source":"Crossref","is-referenced-by-count":2,"title":["Parameterized Complexity Classes under Logical Reductions"],"prefix":"10.1007","author":[{"given":"Anuj","family":"Dawar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuguo","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/978-3-540-45220-1_12","volume-title":"Computer Science Logic","author":"Y. Chen","year":"2003","unstructured":"Chen, Y., Flum, J.: Machine characterization of the classes of the W-hierarchy. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 114\u2013127. Springer, Heidelberg (2003)"},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-13331-3_51","volume-title":"Logic and Machines: Decision Problems and Complexity","author":"E. Dahlhaus","year":"1984","unstructured":"Dahlhaus, E.: Reduction to NP-complete problems by interpretations. In: B\u00f6rger, E., R\u00f6dding, D., Hasenjaeger, G. (eds.) Rekursive Kombinatorik 1983. LNCS, vol.\u00a0171, pp. 357\u2013365. Springer, Heidelberg (1984)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/3-540-18170-9_158","volume-title":"Computation Theory and Logic","author":"E. Dahlhaus","year":"1987","unstructured":"Dahlhaus, E.: Skolem normal forms concerning the least fixpoint. In: B\u00f6rger, E. (ed.) Computation Theory and Logic. LNCS, vol.\u00a0270, pp. 101\u2013106. Springer, Heidelberg (1987)"},{"key":"23_CR4","unstructured":"Dawar, A.: How many first-order variables are needed on finite ordered structures? In: Art\u00ebmov, S.N., Barringer, H., d\u2019Avila Garcez, A.S., Lamb, L.C., Woods, J. (eds.) We Will Show Them! Essays in Honour of Dov Gabbay, vol.\u00a01, pp. 489\u2013520. College Publications (2005)"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","volume":"141","author":"R.G. Downey","year":"1995","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness I\u2014basic results. Theoretical Computer Science\u00a0141, 109\u2013131 (1995)","journal-title":"Theoretical Computer Science"},{"key":"23_CR6","volume-title":"Finite Model Theory","author":"H.-D. Ebbinghaus","year":"1999","unstructured":"Ebbinghaus, H.-D., Flum, J.: Finite Model Theory, 2nd edn. Springer, Heidelberg (1999)","edition":"2"},{"key":"23_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1137\/S0097539799360768","volume":"31","author":"J. Flum","year":"2001","unstructured":"Flum, J., Grohe, M.: Fixed-parameter tractability, definability, and model checking. SIAM Journal on Computing\u00a031, 113\u2013145 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/S0890-5401(03)00161-5","volume":"187","author":"J. Flum","year":"2003","unstructured":"Flum, J., Grohe, M.: Describing parameterized complexity classes. Information and Computation\u00a0187, 291\u2013319 (2003)","journal-title":"Information and Computation"},{"key":"23_CR9","volume-title":"Parameterized complexity theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized complexity theory. Springer, Heidelberg (2006)"},{"key":"23_CR10","volume-title":"Descriptive Complexity","author":"N. Immerman","year":"1998","unstructured":"Immerman, N.: Descriptive Complexity. Springer, Heidelberg (1998)"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","volume":"68","author":"N. Immerman","year":"1986","unstructured":"Immerman, N.: Relational queries computable in polynomial time. Inf. Control\u00a068, 86\u2013104 (1986)","journal-title":"Inf. Control"},{"key":"23_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07003-1","volume-title":"Elements of Finite Model Theory","author":"L. Libkin","year":"2004","unstructured":"Libkin, L.: Elements of Finite Model Theory. Springer, Heidelberg (2004)"},{"key":"23_CR13","doi-asserted-by":"publisher","first-page":"547","DOI":"10.1002\/malq.19770233608","volume":"23","author":"L. Lov\u00e1sz","year":"1977","unstructured":"Lov\u00e1sz, L., G\u00e1cs, P.: Some remarks on generalized spectra. Mathematical Logic Quarterly\u00a023, 547\u2013554 (1977)","journal-title":"Mathematical Logic Quarterly"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Sipser, M.: Borel sets and circuit complexity. In: Proceedings of the Fifteenth Annual ACM Symposium on Theory of Computing, pp. 61\u201369 (1983)","DOI":"10.1145\/800061.808733"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03816-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T07:48:37Z","timestamp":1552117717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03816-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642038150","9783642038167"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03816-7_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}