A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
On Parameterized Intractability: Hardness and Completeness
2007
Computer journal
Preserved Fulltext
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.
doi:10.1093/comjnl/bxm036
fatcat:wjrw57b5nvbfnfib3uii5tviiq