Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
type: Item
instance of: scholarly article
title: Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits
zbMATH Open document ID: 1433.68177
author: Max Bannach
author: Till Tantau
published in: Theory of Computing Systems
publication date: 2020-04-15T00:00:00Z
Mathematics Subject Classification ID: 68Q27
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 68Q06
Mathematics Subject Classification ID: 68W10
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 7189477
zbMATH Keywords: parallel computation
zbMATH Keywords: fixed-parameter tractability
zbMATH Keywords: kernelization
zbMATH Keywords: hitting set
MaRDI profile type: Publication
full work available at URL: s00224-019-09941-z
OpenAlex ID: W2991030129
cites work: Scalable parallel algorithms for FPT problems
cites work: Color-coding
cites work: Q5363777
cites work: Parallel Multivariate Meta-Theorems
cites work: On uniformity within \(NC^ 1\)
cites work: Advice classes of parametrized tractability
cites work: Q4251980
cites work: Some Lower Bounds in Parameterized AC^0.
cites work: Slicewise Definability in First-Order Logic with Bounded Quantifier Rank.
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: On the space and circuit complexity of parameterized problems: classes and completeness
cites work: Intersection Theorems for Systems of Sets
cites work: Q4736854
cites work: Parametrized complexity theory.
cites work: An efficient fixed-parameter algorithm for 3-hitting set
cites work: Parameterized circuit complexity of model-checking on sparse structures
cites work: Towards optimal and expressive kernelization for \(d\)-hitting set
Wikidata QID: Q126648178
DOI: 10.1007/S00224-019-09941-Z
description: scientific article; zbMATH DE number 7189477