Lower Bounds for Kernelization

DOI10.1007/978-3-319-13524-3_1zbMATH Open1456.68063OpenAlexW189387296WikidataQ59567479 ScholiaQ59567479MaRDI QIDQ2946003

Hans L. Bodlaender

Publication date: 15 September 2015

Published in: Parameterized and Exact Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13524-3_1

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (7)

Lower bounds for Haar projections: deterministic examples ⋮ Lower bounds on kernelization ⋮ STACS 2005 ⋮ Algorithmic Learning Theory ⋮ Search-space reduction via essential vertices ⋮ Kernelization Lower Bounds by Cross-Composition ⋮ Title not available (Why is that?)

This page was built for publication: Lower Bounds for Kernelization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946003)