Work

Fixed-parameter intractability

Year: 2003

Type: conference-paper

Abstract: 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.>

Source: Structure in Complexity Theory Annual Conference

DOI: 10.1109/sct.1992.215379

Authors: R.G. Downey, M.R. Fellows

Institution: Victoria University of Wellington

Language: English

Topic: Advanced Graph Theory Research

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: hybrid

OpenAlex ID: W1918504188

FWCI: 1.816

Cites: 12

Cited by: 121

Related to: 10