a

1. Algorithms

2. Reductions

3. Reductions

4. Clique Cover

5. Clique Cover

6. Clique Cover

7. Reductions

8. Reductions

9. Reductions

10. Reductions

11. 3-Colorability <=> Clique Cover

12. 3-Colorability <=> Clique Cover

13. Polynomial Time Reduction

14. Polynomial Time Reduction

15. Polynomial Time Reduction

16. NP-Completeness

17. NP-Completeness

18. Recap

19. Recap

20. Recap

21. Recap

22. cook’s Theorem

23. Boolean Satisfiability Problem

24. Boolean Satisfiability Problem

25. Boolean Satisfiability Problem

26. Boolean Satisfiability Problem

27. Cook’s Theorem

28. 3-Conjuctive Normal Form

29. 3-Conjuctive Normal Form

30. Independent Set Problem

31. Edit Distance

32. Independent Set Problem

33. Independent Set Problem

34. Independent Set Problem

35. Independent Set Problem

36. Independent Set Problem

37. Independent Set Problem

38. 3SAT

39. 3SAT

40. 3SAT

41. 3SAT

42. 3SAT

43. 3SAT

44. Coping with NP-Completeness

45. Graph Coloring

46. Boolean Satisflability problem