Lower bounds for kernelization
From MaRDI portal
Publication:2946003
DOI10.1007/978-3-319-13524-3_1zbMATH Open1456.68063OpenAlexW189387296WikidataQ59567479 ScholiaQ59567479MaRDI QIDQ2946003FDOQ2946003
Authors: 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
Recommendations
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Parameterized complexity, tractability and kernelization (68Q27)
Cited In (23)
- Lower bounds for kernelizations and other preprocessing procedures
- Lower bounds for kernelizations and other preprocessing procedures
- Kernelization: new upper and lower bound techniques
- Kernelization Lower Bounds by Cross-Composition
- Lower bounds for Haar projections: deterministic examples
- Lower bounds for separable approximations of the Hilbert kernel
- On problems without polynomial kernels
- On Problems without Polynomial Kernels (Extended Abstract)
- Title not available (Why is that?)
- Search-space reduction via essential vertices
- Lower bounds on kernelization
- Kernelization lower bounds through colors and IDs
- STACS 2005
- Kernelization lower bounds for finding constant-size subgraphs
- Computing kernels in parallel: lower and upper bounds
- Fractals for kernelization lower bounds, with an application to length-bounded cut problems
- Algorithmic Learning Theory
- Kernels: Annotated, Proper and Induced
- Kernelization techniques and its applications to parameterized computation
- Incompressibility through Colors and IDs
- Fractals for kernelization lower bounds
- Cross-composition: a new technique for kernelization lower bounds
- A hierarchy of polynomial kernels
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)
