Pages that link to "Item:Q4336699"
From MaRDI portal
The following pages link to Computation Models for Parameterized Complexity (Q4336699):
Displayed 10 items.
- On the efficiency of polynomial time approximation schemes (Q290268) (← links)
- On problems without polynomial kernels (Q1034099) (← 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)
- A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
- Parameterized Complexity (Q2841253) (← links)
- A Parameterized Halting Problem (Q2908544) (← links)
- Fixed Structure Complexity (Q3503576) (← links)
- R<scp>OMAN DOMINATION</scp>: a parameterized perspective† (Q5438692) (← links)