Computation Models for Parameterized Complexity

DOI10.1002/malq.19970430204zbMath0870.68063OpenAlexW2158154629MaRDI QIDQ4336699

Miriam Di Ianni, Marco Cesati

Publication date: 14 May 1997

Published in: Mathematical Logic Quarterly (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2108/260205

zbMATH Keywords

Turing machinesparameterized computational problem

Mathematics Subject Classification ID

Related Items (10)

The Turing way to parameterized complexity ⋮ On the efficiency of polynomial time approximation schemes ⋮ A Parameterized Halting Problem ⋮ Fixed Structure Complexity ⋮ A multi-parameter analysis of hard problems on deterministic finite automata ⋮ A parametric analysis of the state-explosion problem in model checking ⋮ R<scp>OMAN DOMINATION</scp>: a parameterized perspective† ⋮ On problems without polynomial kernels ⋮ Parameterized Complexity ⋮ Perfect Code is \(W[1\)-complete]

Cites Work

• On the parameterized complexity of short computation and factorization
• Unnamed Item
• Unnamed Item

This page was built for publication: Computation Models for Parameterized Complexity