role-algorithms:computational-complexity

To prove NP-completeness, construct a polynomial-time reduction from a known NP-complete problem to your target problem. This Skill guides reduction proofs by structuring transformations and verifying complexity class membership.

PTAS and FPTAS are approximation schemes for NP-hard problems, but FPTAS runs in fully polynomial time regarding input size and error margin. This Skill helps classify algorithmic paradigms to select schemes providing provable approximation guarantees.

Classify problem hardness by analyzing solution verifiability and reduction mappings to known complexity classes. This Skill evaluates whether your problem belongs to P, NP-complete, or NP-hard, guiding exact versus heuristic algorithm design choices.

Use parameterized complexity and FPT algorithms when problem hardness is confined to a specific parameter, allowing fixed-parameter tractable solutions. This Skill identifies parameterized structures to design exact algorithms for otherwise intractable computational problems.

Choosing between randomized and heuristic approaches depends on required approximation bounds and runtime constraints. This Skill compares algorithmic paradigms for intractable problems, recommending randomized or heuristic methods when exact solutions are computationally infeasible.

Understanding complexity classes is required, as this Skill relies on knowledge of P vs NP, NP-completeness, and reduction techniques to analyze computational complexity. It builds on these foundations to guide algorithmic paradigm selection.