Machine-based methods in parameterized complexity theory
type: Item
instance of: scholarly article
title: Machine-based methods in parameterized complexity theory
zbMATH Open document ID: 1142.68032
author: Yijia Chen
author: Jörg Flum
author: Martin Grohe
published in: Theoretical Computer Science
publication date: 2005-06-30T00:00:00Z
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 2184097
zbMATH Keywords: Parameterized complexity
zbMATH Keywords: Machine characterizations
zbMATH Keywords: Complexity classes
MaRDI profile type: Publication
full work available at URL: j.tcs.2005.02.003
OpenAlex ID: W2033042995
cites work: On the structure of parameterized problems in NP
cites work: Computer Science Logic
cites work: Threshold dominating sets and an improved characterization of \(W[2]\)
cites work: Q4393480
cites work: Parameterized circuit complexity and the \(W\) hierarchy
cites work: Q4217593
cites work: Fixed-parameter tractability, definability, and model-checking
cites work: Model-Checking Problems as a Basis for Parameterized Intractability
cites work: Q4955325
cites work: Q3221403
cites work: On the complexity of database queries
DOI: 10.1016/J.TCS.2005.02.003
description: scientific article; zbMATH DE number 2184097