Sciweavers

65
Voted
MFCS
2009
Springer
15 years 3 months ago
Parameterized Complexity Classes under Logical Reductions
Abstract. The parameterized complexity classes of the W -hierarchy are usually defined as the problems reducible to certain natural complete problems by means of fixed-parameter ...
Anuj Dawar, Yuguo He