Fixed-parameter intractability

The authors consider the complexity behavior of parametrized problems that they term fixed-parameter tractability: for each fixed parameter value y the problem is solvable in time O(n/sup c/), where c is a constant independent of the parameter y. They introduce a structure theory with which to address the apparent intractability of some parameterized problems, and they obtain completeness, density, and separation/collapse results. The greatest appeal of the theory is in the wide range of natural problems to which it can be applied, and in the practical significance of fixed-parameter problem complexities. Technical aspects are also interesting.<<ETX>>

[1]  Michael R. Fellows,et al.  On the complexity of fixed parameter problems , 1989, 30th Annual Symposium on Foundations of Computer Science.

[2]  Clyde L. Monma,et al.  On the Complexity of Covering Vertices by Faces in a Planar Graph , 1988, SIAM J. Comput..

[3]  Michael R. Fellows,et al.  Fixed Parameter Tractability and Completeness , 1992, Complexity Theory: Current Research.

[4]  Eitan M. Gurari,et al.  Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem , 1984, J. Algorithms.

[5]  Michael R. Fellows,et al.  An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations , 1989, 30th Annual Symposium on Foundations of Computer Science.

[6]  Eugene M. Luks,et al.  Isomorphism of graphs of bounded valence can be tested in polynomial time , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[7]  Michael R. Fellows,et al.  On search decision and the efficiency of polynomial-time algorithms , 1989, STOC '89.

[8]  Kenneth W. Regan.  Finitary substructure languages with application to the theory of NP-completeness , 1989, [1989] Proceedings. Structure in Complexity Theory Fourth Annual Conference.

[9]  Kenneth W. Regan.  Finitary Substructure Languages. , 1989 .

[10]  Michael R. Fellows,et al.  On Well-Partial-Order Theory and its Application to Combinatorial Problems of VLSI Design , 1989, SIAM J. Discret. Math..

[11]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..