On the Complexity of Fixed Parameter Problems (Extended Abstract)

The authors address the question of why some fixed-parameter problem families solvable in polynomial time seem to be harder than others with respect to fixed-parameter tractability: whether there is a constant alpha such that all problems in the family are solvable in time O(n/sup alpha /). The question is modeled by considering a class of polynomially indexed relations. The main results show that (1) this setting supports notions of completeness that can be used to explain the apparent hardness of certain problems with respect to fixed-parameter tractability, and (2) some natural problems are complete. >

Authors

• Karl R. Abrahamson
• John A. Ellis
• Michael R. Fellows
• Manuel E. Mata

Keywords

• Polynomials
• Computer science
• Councils
• Contracts
• Feedback
• Hardness
• Undirected
• Research Authority
• Linear Inequalities
• Well-known Problem
• Family Problems
• Problem Parameters
• Lexicographic
• Family Of Algorithms
• Vertex Cover
• University Department