Computation Models for Parameterized Complexity
type: Item
instance of: scholarly article
title: Computation Models for Parameterized Complexity
zbMATH Open document ID: 0870.68063
author: Marco Cesati
author: Miriam Di Ianni
published in: Mathematical Logic Quarterly
publication date: 1997-05-14T00:00:00Z
full work available at URL: http://hdl.handle.net/2108/260205
Mathematics Subject Classification ID: 68Q05
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 03D10
zbMATH DE Number: 1009466
zbMATH Keywords: parameterized computational problem
zbMATH Keywords: Turing machines
MaRDI profile type: Publication
OpenAlex ID: W2158154629
cites work: On the parameterized complexity of short computation and factorization
cites work: Q4198056
cites work: Q3862379
DOI: 10.1002/MALQ.19970430204
Recommended article: Q4393480
Recommended article: Complexity models for incremental computation
Recommended article: Fundamentals of parameterized complexity
Recommended article: Parameterized complexity: the main ideas and connections to practical computing
Recommended article: Q4417671
Recommended article: Parameterized Complexity and Logic
Recommended article: Q5451198
Recommended article: Q4945215
Recommended article: Parametrized complexity theory.
description: scientific article; zbMATH DE number 1009466