W-hierarchies defined by symmetric gates
type: Item
instance of: scholarly article
title: W-hierarchies defined by symmetric gates
zbMATH Open document ID: 1211.68217
author: Jörg Flum
author: Danny Hermelin
author: Moritz Müller
author: Michael R. Fellows
author: Frances Rosamond
published in: Theory of Computing Systems
publication date: 2010-05-10T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68T20
Mathematics Subject Classification ID: 68M07
zbMATH DE Number: 5706005
zbMATH Keywords: parameterized complexity
zbMATH Keywords: W-hierarchy
zbMATH Keywords: symmetric gates
zbMATH Keywords: bounded weft circuits
MaRDI profile type: Publication
full work available at URL: s00224-008-9138-6
OpenAlex ID: W2126048752
Wikidata QID: Q57359767
cites work: Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
cites work: On the parameterized complexity of short computation and factorization
cites work: The parameterized complexity of maximality and minimality problems
cites work: Machine-based methods in parameterized complexity theory
cites work: Q4217593
cites work: Parameterized Complexity of Independence and Domination on Geometric Graphs
cites work: Q5710169
cites work: Relating monotone formula size and monotone depth of Boolean functions
DOI: 10.1007/S00224-008-9138-6
description: scientific article; zbMATH DE number 5706005