Computation Models for Parameterized Complexity
From MaRDI portal
Publication:4336699
DOI10.1002/MALQ.19970430204zbMATH Open0870.68063OpenAlexW2158154629MaRDI QIDQ4336699FDOQ4336699
Authors: Marco Cesati, Miriam Di Ianni 
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
Recommendations
- scientific article; zbMATH DE number 1161563
- Complexity models for incremental computation
- Fundamentals of parameterized complexity
- Parameterized complexity: the main ideas and connections to practical computing
- scientific article; zbMATH DE number 1956210
- Parameterized Complexity and Logic
- Modified parameterized complexity theory
- scientific article; zbMATH DE number 1424025
- Parametrized complexity theory.
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Turing machines and related notions (03D10)
Cites Work
Cited In (26)
- A Parameterized Halting Problem
- On problems without polynomial kernels
- Fixed Structure Complexity
- On the efficiency of polynomial time approximation schemes
- Computing the complexity for Schelling segregation models
- A parameterized halting problem, the linear time hierarchy, and the MRDP theorem
- Fixed-parameter decidability: extending parameterized complexity analysis
- On the space and circuit complexity of parameterized problems: classes and completeness
- Parameterized complexity: the main ideas and connections to practical computing
- Computational complexity in non-Turing models of computation: the what, the why and the how
- Relativization and interactive proof systems in parameterized complexity theory
- A parametric analysis of the state-explosion problem in model checking
- Machine characterizations for parameterized complexity classes beyond para-NP
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective†
- Machine-based methods in parameterized complexity theory
- A multi-parameter analysis of hard problems on deterministic finite automata
- Polynomial-time versus recursive models
- Perfect Code is \(W[1]\)-complete
- On the structure of parameterized problems in NP
- Fundamentals of parameterized complexity
- The Turing way to parameterized complexity
- Modified parameterized complexity theory
- A logic for PTIME and a parameterized halting problem
- On the computational complexity of cost efficiency analysis models
- Title not available (Why is that?)
- Complexity of Ehrenfeucht models
This page was built for publication: Computation Models for Parameterized Complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4336699)
