A Completeness Theory for Polynomial (Turing) Kernelization
From MaRDI portal
Publication:2867084
DOI10.1007/978-3-319-03898-8_18zbMath1407.68224OpenAlexW2179732776MaRDI QIDQ2867084
Karolina Sołtys, Magnus Wahlström, Danny Hermelin, Xi Wu, Stefan Kratsch
Publication date: 10 December 2013
Published in: Parameterized and Exact Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-03898-8_18
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
Polynomial kernels and user reductions for the workflow satisfiability problem ⋮ Reoptimization of parameterized problems ⋮ A polynomial Turing-kernel for weighted independent set in bull-free graphs
This page was built for publication: A Completeness Theory for Polynomial (Turing) Kernelization
