{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,13]],"date-time":"2026-06-13T10:14:36Z","timestamp":1781345676847,"version":"3.54.1"},"reference-count":35,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,6,1]],"date-time":"1995-06-01T00:00:00Z","timestamp":801964800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6621,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Pure and Applied Logic"],"published-print":{"date-parts":[[1995,6]]},"DOI":"10.1016\/0168-0072(94)00034-z","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T12:51:58Z","timestamp":1053348718000},"page":"235-276","source":"Crossref","is-referenced-by-count":108,"title":["Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues"],"prefix":"10.1016","volume":"73","author":[{"given":"Karl A.","family":"Abrahamson","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Rodney G.","family":"Downey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0168-0072(94)00034-Z_BIB1","series-title":"Proceedings Tenth Annual Symposium on Theoretical Aspects of Computer Science","first-page":"374","article-title":"Fixed parameter intractability II","author":"Abrahamson","year":"1993"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB2","series-title":"Proceedings 30th ACM Foundations of Computer Science (FOCS)","first-page":"210","article-title":"Completeness for families of fixed parameter problems","author":"Abrahamson","year":"1989"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB3","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1137\/0222038","article-title":"Nondeterminism within P","volume":"22","author":"Buss","year":"1993","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(94)00034-Z_BIB4","series-title":"Proceedings of International Conference on Mathematical Foundations of Computer Science (MFCS'93)","first-page":"311","article-title":"On the amount of nondeterminism and the power of verifying","volume":"711","author":"Cai","year":"1993"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB5","doi-asserted-by":"crossref","unstructured":"L. Cai and J. Chen, On fixed-parameter tractability and approximability of NP-hard optimization problems, in: Proceedings Israel Conference on Theoretical Computer Science (ISTCS'93), 118\u2013126.","DOI":"10.1109\/ISTCS.1993.253478"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB6","unstructured":"L. Cai, J. Chen, R. Downey and M. Fellows, Advice classes of parametrized complexity, Ann. Pure Appl. Logic, to appear."},{"key":"10.1016\/0168-0072(94)00034-Z_BIB7","series-title":"Proceedings of the Sacks Conference","article-title":"The parametrized complexity of short computation and factorization","author":"Cai","year":"1993"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB8","series-title":"Logical methods","first-page":"194","article-title":"Undecidability and definability for parameterized polynomial time reducibilities","author":"Cholak","year":"1994"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB9","series-title":"Proceedings Sixth Annual Conference on Computational Learning Theory (COLT'93)","first-page":"51","article-title":"Parametrized learning complexity","author":"Downey","year":"1993"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB10","first-page":"161","article-title":"Fixed parameter tractability and completeness","volume":"87","author":"Downey","year":"1992"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB11","series-title":"Proceedings of 7th Conference on Structure in Complexity Theory","first-page":"36","article-title":"Fixed parameter intractability (extended abstract)","author":"Downey","year":"1992"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB12","doi-asserted-by":"crossref","unstructured":"R. Downey and M. Fellows, Fixed parameter tractability and completeness I: Basic results, SIAM J. Comput., to appear.","DOI":"10.1137\/S0097539792228228"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB13","doi-asserted-by":"crossref","unstructured":"R. Downey and M. Fellows, Fixed parameter tractability and completeness II: On completeness for W[1], Theoret. Comput. Sci., to appear.","DOI":"10.1016\/0304-3975(94)00097-3"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB14","series-title":"Complexity Theory","first-page":"166","article-title":"Fixed parameter tractability and completeness III: Some structural aspects of the W-hierarchy","author":"Downey","year":"1993"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB15","doi-asserted-by":"crossref","unstructured":"R. Downey and M. Fellows, Parametrized computational feasibility, in: P. Clote and J. Remmel, Eds., Proceedings of Feasible Mathematics II (Birkh\u00e4user, Boston to appear).","DOI":"10.1007\/978-1-4612-2566-9_7"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB16","doi-asserted-by":"crossref","unstructured":"R. Downey and M. Fellows, Parameterized Complexity, Monograph, in preparation.","DOI":"10.1007\/978-1-4612-0515-9"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB17_1","series-title":"2nd Workshop on Structural Complexity and Recursion-theoretic Methods in Logic Programming","article-title":"Parametrized complexity of some problems in logic and linguistics (extended abstract)","author":"Downey","year":"1993"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB17_2","series-title":"Logic at St. Petersburg","first-page":"89","volume":"813","author":"Downey","year":"1994"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB18","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1145\/321978.321989","article-title":"A combinatorial problem that is complete in polynomial space","volume":"23","author":"Even","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB19","first-page":"449","article-title":"Beyond NP-completeness for problems of bounded width: hardness for the W-hierarchy (extended abstract)","volume":"26","author":"Bodlaender","year":"1994","journal-title":"STOC"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB20","series-title":"Proceedings First European Symposium on Algorithms, (ESA'93)","first-page":"157","article-title":"DNA physical mapping: three ways difficult","volume":"726","author":"Fellows","year":"1993"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB21","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-56686-4_38","article-title":"Fixed-parameter Complexity and Cryptography","author":"Fellows","year":"1992"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB22","series-title":"Proceedings of the Symposium on Theory of Computing (STOC)","first-page":"501","article-title":"On search, decision and the efficiency of polynomial-time algorithms","author":"Fellows","year":"1989"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB23","series-title":"Proceedings Symposium Foundations of Comp. Sci. (FOCS)","first-page":"520","article-title":"An analogue of the Myhill-Nerode theorem and its use in computing finite basis characterizations","author":"Fellows","year":"1989"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB24","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1137\/0132071","article-title":"The rectilinear Steiner tree is NP-complete","volume":"32","author":"Garey","year":"1977","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0168-0072(94)00034-Z_BIB25","author":"Garey","year":"1979"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB26","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1137\/0209003","article-title":"Refining nondeterminism in relativised polynomial time bounded computations","volume":"9","author":"Kintala","year":"1980","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0168-0072(94)00034-Z_BIB27","series-title":"Proceedings Sixth Annual Structure in Complexity Theory Conference","first-page":"353","article-title":"Approximation properties of NP minimization problems","author":"Kolaitis","year":"1991"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB28","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","article-title":"Planar formulae and their uses","volume":"11","author":"Lichtenstein","year":"1982","journal-title":"SIAM J Comput."},{"key":"10.1016\/0168-0072(94)00034-Z_BIB29","series-title":"Proceedings Eighth Annual Structure in Complexity Conference","first-page":"12","article-title":"On limited nondeterminism and the complexity of the V-C dimension","author":"Papadimitriou","year":"1993"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB30","series-title":"Proceedings Fourth Annual Structure in Complexity Theory Conference","first-page":"87","article-title":"Finite substructure languages","author":"Regan","year":"1989"},{"key":"10.1016\/0168-0072(94)00034-Z_BIB31","unstructured":"N. Robertson and P.D. Seymour, Graph minors XIII. The disjoint paths problem, to appear."},{"key":"10.1016\/0168-0072(94)00034-Z_BIB32","unstructured":"N. Robertson and P.D. Seymour, Graph minors XV. Wagner's conjecture, to appear."},{"key":"10.1016\/0168-0072(94)00034-Z_BIB33","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0022-0000(78)90045-4","article-title":"Complexity of some two-person perfect information games","volume":"16","author":"Schaefer","year":"1978","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0168-0072(94)00034-Z_BIB34","unstructured":"R.G. Downey, M.R. Fellows and K. Regan, Parameterized circuit complexity and the W-hierarchy, to appear."}],"container-title":["Annals of Pure and Applied Logic"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729400034Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016800729400034Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,15]],"date-time":"2019-04-15T00:58:41Z","timestamp":1555289921000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016800729400034Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,6]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,6]]}},"alternative-id":["016800729400034Z"],"URL":"https:\/\/doi.org\/10.1016\/0168-0072(94)00034-z","relation":{},"ISSN":["0168-0072"],"issn-type":[{"value":"0168-0072","type":"print"}],"subject":[],"published":{"date-parts":[[1995,6]]}}}