{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:20:09Z","timestamp":1709832009474},"reference-count":18,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,1]]},"DOI":"10.1016\/s0304-3975(96)00317-9","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T15:40:02Z","timestamp":1049730002000},"page":"97-115","source":"Crossref","is-referenced-by-count":29,"title":["Parameterized circuit complexity and the W hierarchy"],"prefix":"10.1016","volume":"191","author":[{"given":"Rodney G.","family":"Downey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael R.","family":"Fellows","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth W.","family":"Regan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(96)00317-9_BIB1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","article-title":"Fixed parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogs","volume":"73","author":"Abrahamson","year":"1995","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB2","series-title":"Proc. ACM Symp. on the Theory Computing (STOC)","first-page":"449","article-title":"Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy","author":"Bodlaender","year":"1994"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB3","first-page":"757","article-title":"The complexity of finite functions","volume":"Vol. A","author":"Boppana","year":"1990"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB4","article-title":"Sparse parameterized problems","volume":"62","author":"Cesati","year":"1996","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB5","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetical progressions","volume":"9","author":"Coppersmith","year":"1990","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/S0304-3975(96)00317-9_BIB6","series-title":"Proc. Dagstuhl Workshop on Structural Complexity, Complexity Theory: Current Research","first-page":"191","article-title":"Fixed parameter tractability and completeness III: some structural aspects of the W hierarchy","author":"Downey","year":"1993"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB7","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","article-title":"Fixed-parameter tractability and completeness I: basic theory","volume":"24","author":"Downey","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00317-9_BIB8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","article-title":"Fixed-parameter tractability and completeness II: completeness for W[1]","volume":"141","author":"Downey","year":"1995","journal-title":"Theoret. Comput. Sci. A"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB9","series-title":"Proc. 2nd Cornell Workshop on Feasible Mathematics, Feasible Mathematics II","first-page":"219","article-title":"Parameterized computational feasibility","author":"Downey","year":"1995"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB10","series-title":"Proc. Symp. Logical Foundations of Computer Science (LFCS)","first-page":"89","article-title":"The parameterized complexity of some problems in logic and linguistics","volume":"Vol. 813","author":"Downey","year":"1994"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB11","series-title":"Proc. 10th Internat. Symp. on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes (AAECC'93)","first-page":"121","article-title":"Fixed-parameter complexity and cryptography","volume":"Vol. 673","author":"Fellows","year":"1993"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB12","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB13","series-title":"The Graph Isomorphism Problem: Its Structural Complexity","author":"K\u00f6bler","year":"1993"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB14","first-page":"415","article-title":"On the complexity of the subgraph problem","volume":"26","author":"Nesetril","year":"1985","journal-title":"Commen. Math. Univ. Carol."},{"key":"10.1016\/S0304-3975(96)00317-9_BIB15","series-title":"Proc. 4th Ann. IEEE Conf. on Structure in Complexity Theory","first-page":"87","article-title":"Finitary substructure languages","author":"Regan","year":"1989"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB16","series-title":"Proc. 15th ACM Symp. on the Theory of Computing","first-page":"61","article-title":"Borel sets and circuit complexity","author":"Sipser","year":"1983"},{"key":"10.1016\/S0304-3975(96)00317-9_BIB17","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1137\/0220053","article-title":"PP is as hard as the polynomial-time hierarchy","author":"Toda","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(96)00317-9_BIB18","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is as easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"Theoret. Comput. Sci."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003179?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397596003179?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T09:00:01Z","timestamp":1555405201000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397596003179"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":18,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0304397596003179"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(96)00317-9","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}