Linked from

The 12 pages that link to Parameterized complexity, each with the reason it gives.

• Computational complexity theoryRelated: It identifies tractable cases of hard problems when a meaningful parameter is small.

• NP-completenessRelated: It identifies tractable regimes even when a problem is NP-complete in general.

• P versus NP problemCompared with: It investigates tractability distinctions that polynomial-time classification can obscure.

• Time complexityRelated: A problem with poor overall growth may be efficient when a structural parameter is small.

• NP-hardnessRelated: It refines hardness analysis when instances have a meaningful small parameter.

• Analysis of algorithmsRelated: It distinguishes practical cases by structural parameters that ordinary size bounds hide.

• Polynomial timeRelated: It offers tractability distinctions when polynomial time in total input size is too coarse.

• Fixed-parameter tractabilityNarrower topic: Fixed-parameter tractability is its foundational tractability class.

• Clique problemRelated: Clique is a central example of a problem whose parameterized complexity depends sharply on clique size.

• Courcelle's theoremNarrower topic: It distinguishes linear dependence on graph size from potentially large dependence on fixed width and formula.

• Stable roommates problemRelated: Parameters such as the number of blocking pairs can clarify tractability in difficult variants.

• Erdős–Pósa theoremNarrower topic: Cycle packing and feedback vertex set are often studied with their solution size as the parameter.