The following pages link to (Q4281539):
Displaying 14 items.
- On input read-modes of alternating Turing machines (Q672377) (← links)
- Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
- Advice classes of parametrized tractability (Q676315) (← links)
- Counting induced subgraphs: a topological approach to \#W[1]-hardness (Q786040) (← links)
- The complexity of short two-person games (Q1173637) (← links)
- On fixed-parameter tractability and approximability of NP optimization problems (Q1362338) (← links)
- Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey (Q1736791) (← links)
- Peg-solitaire, string rewriting systems and finite automata (Q1885909) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
- Sparse parameterized problems (Q2564046) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- (Q5009487) (← links)
