Content Link: https://github.com/mostafa-saad/ArabicCompetitiveProgramming/raw/master/16%20Misc/04_Algorithms_Misc_NP_Completeness.pdf
Content:
- Intro
- Polynomial-Time Reducibility
-- Partition Problem to Subset Sum
-- Subset Sum to Partition Problem
- Decision & Optimization Problems
- Complexity Class: P, NP, NP-Hard, NP-Complete
- P vs NP?
- Cook–Levin theorem
- NP-Complete Problems
- Approximation
- NPC and Real Life Apps
- NPC and Programming Competitions
