A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time
type: Item
instance of: scholarly article
title: A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time
zbMATH Open document ID: 1465.68111
DOI: 10.1007/978-3-662-48054-0_25
author: Stefan Fafianie
author: Stefan Kratsch
published in: Mathematical Foundations of Computer Science 2015
publication date: 2015-09-16T00:00:00Z
full work available at URL: https://arxiv.org/abs/1504.08235
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 6482817
MaRDI profile type: Publication
OpenAlex ID: W2248154729
arXiv ID: 1504.08235
cites work: Advice classes of parametrized tractability
cites work: Q5743378
cites work: Intersection Theorems for Systems of Sets
cites work: Parametrized complexity theory.
cites work: Efficient Computation of Representative Sets with Applications in Parameterized and Exact Algorithms
cites work: Top-down lower bounds for depth-three circuits
cites work: Extremal Combinatorics
cites work: Q4967164
cites work: An efficient fixed-parameter algorithm for 3-hitting set
cites work: Towards optimal and expressive kernelization for \(d\)-hitting set
description: scientific article