The Turing way to parameterized complexity

✍ Scribed by Marco Cesati

• Publisher: Elsevier Science
• Year: 2003
• Tongue: English
• Weight: 280 KB
• Volume: 67
• Category: Article
• ISSN: 0022-0000
• DOI: 10.1016/s0022-0000(03)00073-4

✦ Synopsis

We propose a general proof technique based on the Turing machine halting problem that allows us to establish membership results for the classes W[1], W[2], and W[P]. Using this technique, we prove that Perfect Code belongs to W[1], Steiner Tree belongs to W[2], and a-Balanced Separator, Maximal Irredundant Set, and Bounded DFA Intersection belong to W[P].