Pages that link to "Item:Q4336699"
From MaRDI portal
The following pages link to Computation Models for Parameterized Complexity (Q4336699):
Displaying 21 items.
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- Fundamentals of parameterized complexity (Q383833) (← links)
- Machine-based methods in parameterized complexity theory (Q557897) (← links)
- Computing the complexity for Schelling segregation models (Q718797) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Polynomial-time versus recursive models (Q1182471) (← links)
- On the parameterized complexity of short computation and factorization (Q1387097) (← links)
- Perfect Code is \(W[1]\)-complete (Q1603518) (← links)
- The Turing way to parameterized complexity (Q1877697) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
- On the computational complexity of cost efficiency analysis models (Q2371474) (← links)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- On the structure of parameterized problems in NP (Q2508336) (← links)
- Computational complexity in non-Turing models of computation: the what, the why and the how (Q2825338) (← links)
- Parameterized complexity: the main ideas and connections to practical computing (Q2841253) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- Fixed-parameter decidability: Extending parameterized complexity analysis (Q2958220) (← links)
- Fixed Structure Complexity (Q3503576) (← links)
- Complexity of Ehrenfeucht models (Q3546055) (← links)
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective† (Q5438692) (← links)
