@article{CESATI2003654,
Abstract = {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 {$\alpha$}-Balanced Separator, Maximal Irredundant Set, and Bounded DFA Intersection belong to W[P].},
Author = {Cesati, Marco},
File = {10.1.1.159.1305 (0) (0) - a - a - g.pdf},
ISSN = {0022-0000},
Journal = {Journal of Computer and System Sciences},
Keywords = {Parameterized complexity, W-class membership, Turing machine, Halting problem},
Note = {Parameterized Computation and Complexity 2003},
Number = {4},
Pages = {654 - 685},
Title = {The Turing way to parameterized complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0022000003000734},
Volume = {67},
Year = {2003},
bdsk-url-1 = {http://www.sciencedirect.com/science/article/pii/S0022000003000734},
bdsk-url-2 = {https://doi.org/10.1016/S0022-0000(03)00073-4},
date-added = {2019-04-01 17:04:47 +0200},
date-modified = {2019-04-01 17:04:47 +0200},
doi = {10.1016/S0022-0000(03)00073-4}
}
Library Size: 13G (12942 entries),
Last Updated: Apr 05, 2026, 08:41:35,
Build Time: N/A