DocumentCode :
2127792
Title :
On the complexity of fixed parameter problems
Author :
Abrahamson, Karl R. ; Fellows, M.R. ; Ellis, John A. ; Mata, Manuel E.
Author_Institution :
Dept. of Comput. Sci., Washington State Univ., Pullman, WA, USA
fYear :
1989
fDate :
30 Oct-1 Nov 1989
Firstpage :
210
Lastpage :
215
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 α such that all problems in the family are solvable in time O(nα). 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
Keywords :
computational complexity; polynomials; completeness; complexity; fixed parameter problems; fixed-parameter tractability; polynomial time; polynomially indexed relations; Computer science; Contracts; Councils; Feedback; Polynomials;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Foundations of Computer Science, 1989., 30th Annual Symposium on
Conference_Location :
Research Triangle Park, NC
Print_ISBN :
0-8186-1982-1
Type :
conf
DOI :
10.1109/SFCS.1989.63480
Filename :
63480
Link To Document :
بازگشت