Pages that link to "Item:Q1892937"
From MaRDI portal
The following pages link to Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937):
Displaying 15 items.
- Parameterized complexity of discrete Morse theory (Q2828168) (← links)
- Parameterized complexity: the main ideas and connections to practical computing (Q2841253) (← links)
- The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
- A Basic Parameterized Complexity Primer (Q2908536) (← links)
- Parameterized Complexity and Subexponential-Time Computability (Q2908538) (← links)
- Fixed-parameter decidability: Extending parameterized complexity analysis (Q2958220) (← links)
- Kernelization: New Upper and Lower Bound Techniques (Q3656848) (← links)
- (Q5009469) (← links)
- Solving Target Set Selection with Bounded Thresholds Faster than 2^n (Q5009485) (← links)
- A Retrospective on (Meta) Kernelization (Q5042460) (← links)
- Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack (Q5075797) (← links)
- (Q5111868) (← links)
- An analysis of the W*-hierarchy (Q5294024) (← links)
- (Q6068238) (← links)
- Complexity of maker-breaker games on edge sets of graphs (Q6657252) (← links)