Pages that link to "Item:Q1387097"

The following pages link to On the parameterized complexity of short computation and factorization (Q1387097):

Displaying 30 items.

• Parameterized complexity and approximability of the longest compatible sequence problem (Q456697) (← links)
• Confronting intractability via parameters (Q465686) (← links)
• Fixed-parameter tractability and completeness II: On completeness for W[1] (Q673779) (← links)
• Advice classes of parametrized tractability (Q676315) (← links)
• Parameterized complexity in multiple-interval graphs: domination, partition, separation, irredundancy (Q690460) (← links)
• The complexity ecology of parameters: An illustration using bounded max leaf number (Q733736) (← links)
• Simplifying the weft hierarchy (Q820144) (← links)
• Chordless paths through three vertices (Q820149) (← links)
• W-hierarchies defined by symmetric gates (Q970108) (← links)
• On the parameterized complexity of multiple-interval graph problems (Q1001898) (← links)
• Threshold dominating sets and an improved characterization of \(W[2]\) (Q1274918) (← links)
• Perfect Code is \(W[1]\)-complete (Q1603518) (← links)
• Reconfiguration on sparse graphs (Q1747496) (← links)
• On the parametric complexity of schedules to minimize tardy tasks. (Q1874274) (← links)
• The Turing way to parameterized complexity (Q1877697) (← links)
• \(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling (Q1919171) (← links)
• The complexity of irredundant sets parameterized by size (Q1971218) (← links)
• Parameterized complexity of a coupled-task scheduling problem (Q2283295) (← links)
• On the space and circuit complexity of parameterized problems: classes and completeness (Q2343093) (← links)
• A parametric analysis of the state-explosion problem in model checking (Q2495399) (← links)
• The Birth and Early Years of Parameterized Complexity (Q2908529) (← links)
• A Basic Parameterized Complexity Primer (Q2908536) (← links)
• A Parameterized Halting Problem (Q2908544) (← links)
• Parameterized Complexity and Approximability of the SLCS Problem (Q3503583) (← links)
• Computation Models for Parameterized Complexity (Q4336699) (← links)
• On the Complexity of the Montes Ideal Factorization Algorithm (Q4931648) (← links)
• Synchronizing series-parallel deterministic finite automata with loops and related problems (Q5021111) (← links)
• The straight line complexity of small factorials and primorials (Q5246203) (← links)
• Sorting by prefix block-interchanges (Q6038693) (← links)
• (Q6065464) (← links)