On Parameterized Intractability: Hardness and Completeness Academic Article uri icon

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. © The Author 2008. Published by Oxford University Press on behalf of The British Computer Society. All rights reserved.

author list (cited authors)

  • Chen, J., & Meng, J.

citation count

  • 10

publication date

  • March 2007