main page — CS 627 Advanced Algorithms
Unit 5: Parameterized Hardness
This unit covers
- fpt-reductions
- para-NP-hardness
- W[1]-hardness
Material
— to be added —
Further reading and sources
Many examples are taken from Advanced Algorithms, following the module in Kaiserslautern initially developed by Markus Nebel.
Further reading:
- Flum, Grohe (2006): Parameterized Complexity Theory
- M. Cygan et al. (2015): Parameterized Algorithms