{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:57:02Z","timestamp":1725566222152},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540230717"},{"type":"electronic","value":"9783540286394"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28639-4_17","type":"book-chapter","created":{"date-parts":[[2010,9,20]],"date-time":"2010-09-20T20:25:35Z","timestamp":1285014335000},"page":"187-199","source":"Crossref","is-referenced-by-count":0,"title":["Simplifying the Weft Hierarchy"],"prefix":"10.1007","author":[{"given":"Jonathan F.","family":"Buss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tarique","family":"Islam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1137\/S0097539793258295","volume":"26","author":"L. Cai","year":"1997","unstructured":"Cai, L., Chen, J.: On the Amount of Nondeterminism and the Power of Verifying. SIAM J. Computing\u00a026(3), 733\u2013750 (1997)","journal-title":"SIAM J. Computing"},{"key":"17_CR2","unstructured":"Cai, L., Chen, J., Downey, R.G., Fellows, M.R.: On the Complexity of Short Computation and Factorization. Archiv. Math. Logic"},{"key":"17_CR3","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 theW-hierarchy. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol.\u00a02803, pp. 114\u2013127. Springer, Heidelberg (2003)"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Chen, Y., Flum, J., Grohe, M.: Bounded Nondeterminism and Alternation in Parameterized Complexity Theory. In: 18th Ann. IEEE Conf. Computational Complexity, pp. 18\u201329 (2003)","DOI":"10.1109\/CCC.2003.1214407"},{"key":"17_CR5","first-page":"161","volume":"87","author":"R.G. Downey","year":"1992","unstructured":"Downey, R.G., Fellows, M.R.: Fixed-Parameter Tractability and Completeness. Congressus Numerantium\u00a087, 161\u2013187 (1992)","journal-title":"Congressus Numerantium"},{"key":"17_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, New York (1999)"},{"issue":"1","key":"17_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 J. Computing\u00a031(1), 113\u2013145 (2001)","journal-title":"SIAM J. Computing"}],"container-title":["Lecture Notes in Computer Science","Parameterized and Exact Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28639-4_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:29:55Z","timestamp":1620012595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-28639-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540230717","9783540286394"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28639-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}