KnowraParameterized complexityLinked fromLinked fromThe 12 pages that link to Parameterized complexity, each with the reason it gives.All 12Related 8Narrower topic 3Compared with 1Fixed-parameter tractabilityNarrower topic: Fixed-parameter tractability is its foundational tractability class.Courcelle's theoremNarrower topic: It distinguishes linear dependence on graph size from potentially large dependence on fixed width and formula.Erdős–Pósa theoremNarrower topic: Cycle packing and feedback vertex set are often studied with their solution size as the parameter.