3415 search results - page 1 / 683 » Lower Bounds for Kernelizations |
STACS
2005
Springer
13 years 10 months ago
2005
Springer
TAPAS
2011
12 years 11 months ago
2011
We study upper and lower bounds on the kernel size for the 3-hitting set problem on hypergraphs of degree at most 3, denoted 33-hs. We first show that, unless P=NP, 3-3-hs on 3-un...
CORR
2010
Springer
13 years 1 months ago
2010
Springer
We introduce a new technique for proving kernelization lower bounds, called cross-composition. A classical problem L cross-composes into a parameterized problem Q if an instance o...
JC
2011
12 years 11 months ago
2011
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
ECCC
2007
13 years 4 months ago
2007