Algorithms
Lecture #45
Dr.Sohail Aslam
Reductions
Reductions
Clique Cover
Clique Cover
Clique Cover
Reductions
Reductions
Reductions
Reductions
3-Colorability <=> Clique Cover
3-Colorability <=> Clique Cover
Polynomial Time Reduction
Polynomial Time Reduction
Polynomial Time Reduction
NP-Completeness
NP-Completeness
Recap
Recap
Recap
Recap
cook’s Theorem
Boolean Satisfiability Problem
Boolean Satisfiability Problem
Boolean Satisfiability Problem
Boolean Satisfiability Problem
cook’s Theorem
3-Conjuctive Normal Form
3-Conjuctive Normal Form
Independent Set Problem
Edit Distance
Independent Set Problem
Independent Set Problem
Independent Set Problem
Independent Set Problem
Independent Set Problem
Independent Set Problem
3SAT
3SAT
3SAT
3SAT
3SAT
3SAT
Coping with NP-Completeness
Graph Coloring
Boolean Satisflability problem
Upcoming SlideShare
Loading in …5
×

Algorithm lecture45

208 views
170 views

Published on

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
208
On SlideShare
0
From Embeds
0
Number of Embeds
0
Actions
Shares
0
Downloads
2
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Algorithm lecture45

  1. 1. Algorithms Lecture #45 Dr.Sohail Aslam
  2. 2. Reductions
  3. 3. Reductions
  4. 4. Clique Cover
  5. 5. Clique Cover
  6. 6. Clique Cover
  7. 7. Reductions
  8. 8. Reductions
  9. 9. Reductions
  10. 10. Reductions
  11. 11. 3-Colorability <=> Clique Cover
  12. 12. 3-Colorability <=> Clique Cover
  13. 13. Polynomial Time Reduction
  14. 14. Polynomial Time Reduction
  15. 15. Polynomial Time Reduction
  16. 16. NP-Completeness
  17. 17. NP-Completeness
  18. 18. Recap
  19. 19. Recap
  20. 20. Recap
  21. 21. Recap
  22. 22. cook’s Theorem
  23. 23. Boolean Satisfiability Problem
  24. 24. Boolean Satisfiability Problem
  25. 25. Boolean Satisfiability Problem
  26. 26. Boolean Satisfiability Problem
  27. 27. cook’s Theorem
  28. 28. 3-Conjuctive Normal Form
  29. 29. 3-Conjuctive Normal Form
  30. 30. Independent Set Problem
  31. 31. Edit Distance
  32. 32. Independent Set Problem
  33. 33. Independent Set Problem
  34. 34. Independent Set Problem
  35. 35. Independent Set Problem
  36. 36. Independent Set Problem
  37. 37. Independent Set Problem
  38. 38. 3SAT
  39. 39. 3SAT
  40. 40. 3SAT
  41. 41. 3SAT
  42. 42. 3SAT
  43. 43. 3SAT
  44. 44. Coping with NP-Completeness
  45. 45. Graph Coloring
  46. 46. Boolean Satisflability problem

×