{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,26]],"date-time":"2026-09-26T06:39:14Z","timestamp":1790404754054,"version":"4.1.0"},"reference-count":24,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/ccc.2003.1214407","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"13-29","source":"Crossref","is-referenced-by-count":25,"title":["Bounded nondeterminism and alternation in parameterized complexity theory"],"prefix":"10.1109","author":[{"given":"Y.","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Flum","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"M.","family":"Grohe","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0539-5"},{"key":"22","author":"stege","year":"2000","journal-title":"Resolving Conflicts in Problems from Computational Biology"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(86)80029-8"},{"key":"23","first-page":"137","article-title":"The complexity of relational query languages","author":"vardi","year":"1982","journal-title":"Proceedings of the 14th ACM Symposium on Theory of Computing"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1137\/0216051"},{"key":"24","first-page":"266","article-title":"On the complexity of bounded-variable queries","author":"vardi","year":"1995","journal-title":"Proc ACM Symp Principles Database Systems"},{"key":"15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-46767-X_1","article-title":"Fixed-parameter complexity in AI and nonmonotonic reasoning","volume":"1730","author":"gottlob","year":"1999","journal-title":"Lecture Notes in Computer Science"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1145\/375551.375564"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539799360768"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45841-7_29"},{"key":"11","author":"ebbinghaus","year":"1999","journal-title":"Finite Model Theory"},{"key":"12","first-page":"43","article-title":"Generalized first-order spectra and polynomial-time recognizable sets","volume":"7","author":"fagin","year":"1974","journal-title":"Complexity of Computation SIAM-AMS Proceedings"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1999.1626"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/11.1.49"},{"key":"20","author":"papadimitriou","year":"1994","journal-title":"Computational Complexity"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2001.959895"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1016\/0168-0072(94)00034-Z"},{"key":"10","first-page":"194","article-title":"The parameterized complexity of relational database queries and an improved characterization of W[1]","author":"downey","year":"1996","journal-title":"Combinatorics Complexity and Logic in Proceedings of DMTCS"},{"key":"7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0515-9","author":"downey","year":"1999","journal-title":"Parameterized Complexity"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322243"},{"key":"5","author":"cesati","year":"2001","journal-title":"The Turing Way to the Parameterized Intractability"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s001530050069"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(96)00317-9"},{"key":"8","first-page":"119","article-title":"Descriptive complexity and the W-hierarchy","volume":"39","author":"downey","year":"1998","journal-title":"AMS-DIMACS Volume Series"}],"event":{"name":"18th IEEE Annual Conference on Computational Complexity","location":"Aarhus, Denmark","acronym":"CCC-03"},"container-title":["18th IEEE Annual Conference on Computational Complexity, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8614\/27296\/01214407.pdf?arnumber=1214407","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:26:13Z","timestamp":1497572773000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214407\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":24,"URL":"https:\/\/doi.org\/10.1109\/ccc.2003.1214407","relation":{},"subject":[]}}