Title :
Parameterized complexity for the skeptic
Author_Institution :
Sch. of Math. & Comput. Sci., Victoria Univ., Wellington, New Zealand
Abstract :
The goal is to provide a tourist guide, with an eye towards structural issues, to what I consider some of the major highlights of parameterized complexity.
Keywords :
Turing machines; computability; computational complexity; set theory; trees (mathematics); nondeterministic Turing machine; parameterized complexity; satisfiability; tree decomposition; vertex cover set; Algorithm design and analysis; Biological materials; Biology computing; Combinatorial mathematics; Computational biology; Computational complexity; Polynomials; Systematics; Time measurement;
Conference_Titel :
Computational Complexity, 2003. Proceedings. 18th IEEE Annual Conference on
Print_ISBN :
0-7695-1879-6
DOI :
10.1109/CCC.2003.1214417
