Sciweavers

3415 search results - page 1 / 683
» Lower Bounds for Kernelizations
Sort
View
TAPAS
2011
255views Algorithms» more  TAPAS 2011»
13 years 5 months ago
3-hitting set on Bounded Degree Hypergraphs: Upper and Lower Bounds on the Kernel Size
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...
Iyad A. Kanj, Fenghui Zhang
CORR
2010
Springer
162views Education» more  CORR 2010»
13 years 7 months ago
Cross-Composition: A New Technique for Kernelization Lower Bounds
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...
Hans L. Bodlaender, Bart M. P. Jansen, Stefan Krat...
JC
2011
87views more  JC 2011»
13 years 5 months ago
Lower bounds for the complexity of linear functionals in the randomized setting
Abstract. Hinrichs [3] recently studied multivariate integration defined over reproducing kernel Hilbert spaces in the randomized setting and for the normalized error criterion. I...
Erich Novak, Henryk Wozniakowski
ECCC
2007
89views more  ECCC 2007»
13 years 10 months ago
Lower Bounds for Kernelizations
Yijia Chen, Jörg Flum, Moritz Müller