Diminishable parameterized problems and strict polynomial kernelization

Till Fluschnik
Till Fluschnik
Hendrik Molter
Hendrik Molter

Computability, pp. 1-24, 2020.

Cited by: 0|Views38
EI

Abstract:

Kernelization---a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems---plays a central role in parameterized complexity and has triggered an extensive line of research. This is in part due to a lower bounds framework that allows to exclude polynomial-size kernels under the assumption of NP ...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments