{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:26:16Z","timestamp":1759638376338},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_12","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T19:33:58Z","timestamp":1277494438000},"page":"114-127","source":"Crossref","is-referenced-by-count":12,"title":["Machine Characterizations of the Classes of the W-Hierarchy"],"prefix":"10.1007","author":[{"given":"Yijia","family":"Chen","sequence":"first","affiliation":[]},{"given":"J\u00f6rg","family":"Flum","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s001530050069","volume":"36","author":"L. Cai","year":"1997","unstructured":"Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: On the parameterized complexity of short computation and factorization. Archive for Mathematical Logic\u00a036, 321\u2013337 (1997)","journal-title":"Archive for Mathematical Logic"},{"unstructured":"Cesati, M.: The Turing way to parameterized intractability (2001) (submitted for publication)","key":"12_CR2"},{"key":"12_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1002\/malq.19970430204","volume":"43","author":"M. Cesati","year":"1997","unstructured":"Cesati, M., Di Ianni, M.: Computation models for parameterized complexity. Math. Log. Quart.\u00a043, 179\u2013202 (1997)","journal-title":"Math. Log. Quart."},{"unstructured":"Chen, Y., Flum, J., Grohe, M.: Bounded nondeterminism and alternation in parameterized complexity theory. To appear in Proc. of the Conference on Computational Complexity (2003), Available at http:\/\/www.dcs.ed.ac.uk\/home\/grohe\/pub.html","key":"12_CR4"},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0304-3975(97)00101-1","volume":"209","author":"R.G. Downey","year":"1996","unstructured":"Downey, R.G., Fellows, M.R.: Threshold dominating set and an improved characterization of W[2]. Theoretical Computer Science\u00a0209, 123\u2013140 (1996)","journal-title":"Theoretical Computer Science"},{"key":"12_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)"},{"doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R., Regan, K.: Descriptive complexity and the Whierarchy. In: Beame, P., Buss, S. (eds.) Proof Complexity and Feasible Arithmetic. AMS-DIMACS Volume Series, vol.\u00a039, pp. 119\u2013134. AMS (1998)","key":"12_CR7","DOI":"10.1090\/dimacs\/039\/07"},{"issue":"1","key":"12_CR8","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(1), 113\u2013145 (2001)","journal-title":"SIAM Journal on Computing"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1007\/3-540-45841-7_29","volume-title":"STACS 2002","author":"J. Flum","year":"2002","unstructured":"Flum, J., Grohe, M.: Describing parameterized complexity classes. In: Alt, H., Ferreira, A. (eds.) STACS 2002. LNCS, vol.\u00a02285, pp. 359\u2013371. Springer, Heidelberg (2002)"},{"key":"12_CR10","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T09:01:47Z","timestamp":1559206907000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}