On Parameterized Intractability: Hardness and Completeness
The Computer Journal2007Vol. 51(1), pp. 39–59
Citations Over TimeTop 23% of 2007 papers
Abstract
We study the theory and techniques developed in the research of parameterized intractability, emphasizing on parameterized hardness and completeness that imply (stronger) computational lower bounds for natural computational problems. Moreover, the fundamentals of the structural properties in parameterized complexity theory, relationships to classical complexity theory and more recent developments in the area are also introduced.