Pages that link to "Item:Q1127315"

The following pages link to Parameterized circuit complexity and the \(W\) hierarchy (Q1127315):

Displaying 15 items.

• Effective computation of immersion obstructions for unions of graph classes (Q395009) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Machine-based methods in parameterized complexity theory (Q557897) (← links)
• The challenges of unbounded treewidth in parameterised subgraph counting problems (Q897601) (← links)
• The parameterized complexity of probability amplification (Q975525) (← links)
• Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
• The complexity of first-order and monadic second-order logic revisited (Q1886318) (← links)
• Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues (Q1892937) (← links)
• Parameterized random complexity (Q1946497) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• Surfing with Rod (Q2973715) (← links)
• Parameterized Derandomization (Q3503586) (← links)
• (Q5092423) (← links)
• On the partial vertex cover problem in bipartite graphs -- a parameterized perspective (Q6151150) (← links)