Pages that link to "Item:Q557897"
From MaRDI portal
The following pages link to Machine-based methods in parameterized complexity theory (Q557897):
Displaying 22 items.
- Parameterized complexity of three edge contraction problems with degree constraints (Q471188) (← links)
- W-hierarchies defined by symmetric gates (Q970108) (← links)
- The parameterized complexity of editing graphs for bounded degeneracy (Q986553) (← links)
- Parameterized circuit complexity and the \(W\) hierarchy (Q1127315) (← links)
- On the parameterized complexity of short computation and factorization (Q1387097) (← links)
- Describing parameterized complexity classes (Q1877556) (← links)
- Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
- Parameterized random complexity (Q1946497) (← links)
- Set graphs. III: Proof pearl: Claw-free graphs mirrored into transitive hereditarily finite sets (Q2352482) (← links)
- Bounded fixed-parameter tractability and reducibility (Q2382273) (← links)
- Algorithms in the W-hierarchy (Q2464321) (← links)
- The parameterized complexity of maximality and minimality problems (Q2470035) (← links)
- A Purely Democratic Characterization of W[1] (Q3503582) (← links)
- Parameterized Derandomization (Q3503586) (← links)
- (Q3974591) (← links)
- (Q4972729) (← links)
- (Q5005177) (← links)
- (Q5111868) (← links)
- An analysis of the W*-hierarchy (Q5294024) (← links)
- On Covering Segments with Unit Intervals (Q5864214) (← links)
- The complexity of tree partitioning (Q5918926) (← links)
- Parameterised counting in logspace (Q6093373) (← links)