On Parameterized Intractability: Hardness and Completeness

@article{Chen2008OnPI,
  title={On Parameterized Intractability: Hardness and Completeness},
  author={Jianer Chen and Jie Meng},
  journal={Comput. J.},
  year={2008},
  volume={51},
  pages={39-59}
}
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. 

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…