Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > DETAIL:

Paper:

TR04-027 | 20th February 2004 00:00

Parametric Duality: Kernel Sizes and Algorithmics

RSS-Feed




TR04-027
Authors: Henning Fernau
Publication: 9th April 2004 21:18
Downloads: 1331
Keywords: 


Abstract:

We derive the first lower bound results on kernel sizes of parameterized problems. The same idea also allows us to sometimes "de-parameterize"
parameterized algorithms.



ISSN 1433-8092 | Imprint