The DOI matches its Crossref record; 26 of the 26 references it cites were found in a registry or an index.
Fixed-Parameter Tractability and Completeness I: Basic Results
Abstract
For many fixed-parameter problems that are trivially soluable in polynomial time, such as $(k\text{-})$ DOMINATING SET, essentially no better algorithm is presently known than the one which tries all possible solutions. Other problems, such as $(k\text{-})$ FEEDBACK VERTEX SET, exhibit fixed-parameter tractability: for each fixed k the problem is soluable in time bounded by a polynomial of degree c, where c is a constant independent of k. We establish the main results of a completeness program which addresses the apparent fixed-parameter intractability of many parameterized problems. In particular, we define a hierarchy of classes of parameterized problems $FPT \subseteq W[1] \subseteq W[2] \subseteq \cdots \subseteq W[SAT] \subseteq W [P]$ and identify natural complete problems for $W[t]$ for $t \geq 2$. (In other papers we have shown many problems complete for $W[1]$.) DOMINATING SET is shown to be complete for $W[2]$, and thus is not fixed-parameter tractable unless INDEPENDENT SET, CLIQUE, IRREDUNDANT SET, and many other natural problems in $W[2]$ are also fixed-parameter tractable. We also give a compendium of currently known hardness results as an appendix.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Reducibility among Combinatorial Problems
Karp, R. M. (1972) · Complexity of Computer Computations · doi:10.1007/978-1-4684-2001-2_9 · Cited by 11,511
Introduction to automata theory, languages, and computation
(1980) · Computer Languages · doi:10.1016/0096-0551(80)90011-9 · Cited by 6,824
The complexity of computing the permanent
Valiant, L. G. (1979) · Theoretical Computer Science · doi:10.1016/0304-3975(79)90044-6 · Cited by 2,705
Downey, R. G., & Fellows, M. R. (1999) · Monographs in Computer Science · doi:10.1007/978-1-4612-0515-9 · Cited by 2,532
Self-citationGraph Minors .XIII. The Disjoint Paths Problem
Robertson, N., & Seymour, P. D. (1995) · Journal of Combinatorial Theory, Series B · doi:10.1006/jctb.1995.1006 · Cited by 1,262
Complexity of Finding Embeddings in a k-Tree
Arnborg, S., Corneil, D. G., & Proskurowski, A. (1987) · SIAM Journal on Algebraic Discrete Methods · doi:10.1137/0608024 · Cited by 1,206
On the Structure of Polynomial Time Reducibility
Ladner, R. E. (1975) · Journal of the ACM · doi:10.1145/321864.321877 · Cited by 781
Dreyfus, S. E., & Wagner, R. A. (1971) · Networks · doi:10.1002/net.3230010302 · Cited by 696
Isomorphism of graphs of bounded valence can be tested in polynomial time
Luks, E. M. (1982) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(82)90009-5 · Cited by 645
NP is as easy as detecting unique solutions
Valiant, L. G., & Vazirani, V. V. (1986) · Theoretical Computer Science · doi:10.1016/0304-3975(86)90135-0 · Cited by 635
Graph Rewriting: An Algebraic and Logic Approach
Courcelle, B. (1990) · Elsevier eBooks · doi:10.1016/b978-0-444-88074-1.50010-x · Cited by 549
Handbook of Theoretical Computer Science, Vol. A
Leeuwen, J. V. (1990) · Cited by 415
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey
Arnborg, S. (1985) · BIT · doi:10.1007/bf01934985 · Cited by 362
Buss, J. F., & Goldsmith, J. (1993) · SIAM Journal on Computing · doi:10.1137/0222038 · Cited by 308
Brightwell, G., & Winkler, P. (1991) · Order · doi:10.1007/bf00383444 · Cited by 276
Structure preserving reductions among convex optimization problems
Ausiello, G., D'Atri, A., & Protasi, M. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90046-x · Cited by 264
Complexity results for classes of quantificational formulas
Lewis, H. R. (1980) · Journal of Computer and System Sciences · doi:10.1016/0022-0000(80)90027-6 · Cited by 205
Non deterministic polynomial optimization problems and their approximations
Paz, A., & Moran, S. (1981) · Theoretical Computer Science · doi:10.1016/0304-3975(81)90081-5 · Cited by 183
Parameterized Computational Feasibility
Downey, R. G., & Fellows, M. R. (1995) · Feasible Mathematics II · doi:10.1007/978-1-4612-2566-9_7 · Cited by 164
Self-citationFixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogues
Abrahamson, K. A., Downey, R. G., & Fellows, M. R. (1995) · Annals of Pure and Applied Logic · doi:10.1016/0168-0072(94)00034-z · Cited by 158
Self-citationGurevich, Y. G., & Shelah, S. (1989) · Lecture notes in computer science · doi:10.1007/3-540-51237-3_10 · Cited by 94
Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
Kintala, C. M. R., & Fischer, P. C. (1980) · SIAM Journal on Computing · doi:10.1137/0209003 · Cited by 82
Parameterized circuit complexity and the W hierarchy
Downey, R. G., Fellows, M. R., & Regan, K. W. (1998) · Theoretical Computer Science · doi:10.1016/s0304-3975(96)00317-9 · Cited by 45
Self-citationDavis, M. D. (1977) · Studies in logic and the foundations of mathematics · doi:10.1016/s0049-237x(08)71115-7 · Cited by 42
OptP as the normal behavior of NP-complete problems
Gasarch, W. I., Krentel, M. W., & Rappoport, K. J. (1995) · Theory of Computing Systems · doi:10.1007/bf01204168 · Cited by 27
A simple linear-time algorithm for finding path-decompositions of small width
Cattell, K., Dinneen, M. J., & Fellows, M. R. (1996) · Information Processing Letters · doi:10.1016/0020-0190(95)00190-5 · Cited by 20
Self-citation
Cited by
Treewidth: Algorithmic techniques and results
Bodlaender, H. L. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0029946 · Cited by 289
Metadata
- Authors
- Downey, R. G., & Fellows, M. R.
- Venue
- SIAM Journal on Computing
- Published
- 1995-08
- Volume
- 24
- Issue
- 4
- Pages
- 873-921
- ISSN
- 0097-5397 (ISSN-L)
- 1095-7111
- OpenAlex
- W2022841964
- Cited by
- 468
- References
- 26
- FWCI
- 17.85
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.