11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLOGY
THE CONCEPT OF           NP-COMPLETENESS           IN A NUTSHELL11/08/12       M J COLLEGE OF ENGINEERING AND TECHNOLO
Consider a sample  Pentium computerwhich you see in the lab.                     PENTIUM COMPUTER  DETERMINISTIC WALLAH   ...
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
PROBLEMS           TRACTABLE                INTRACTABLE11/08/12                M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
PROBLEMS   TRACTABLE               SEEMINGLY          TRULY               INTRACTABLE     INTRACTABLE11/08/12             ...
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
TRACTABLE PROBLEMS FOR A                DETERMINISTIC COMPUTER           HEAPSORT, MERGESORT, BUBBLE SORT, BINARY         ...
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
SEEMINGLY INTRACTABLE PROBLEMS FOR A         DETERMINISTIC PENTIUM COMPUTER                       AND           SEEMINGLY ...
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
TRACTABLE PROBLEMS FOR A NONDETERMINISTIC                  PENTIUM COMPUTER                  THE CLASS NP       SATISFIABI...
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
TRACTABLE PROBLEMS    THE CLASS P                                       THE CLASS NP11/08/12                   M J COLLEGE...
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
NP-WORLD           P-WORLD11/08/12       M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
P=NP11/08/12      M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
NP-COMPLETE                 PROBLEMS           THE HAMILTONIAN CIRCUIT PROBLEM,           THE TRAVELING SALESMAN PROBLEM, ...
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
11/08/12   M J COLLEGE OF ENGINEERING AND TECHNOLO
Upcoming SlideShare
Loading in …5
×

E37npcompleteness

216 views

Published on

jntu qualitative visual algorithms

Published in: Entertainment & Humor
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

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

No notes for slide

E37npcompleteness

  1. 1. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLOGY
  2. 2. THE CONCEPT OF NP-COMPLETENESS IN A NUTSHELL11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  3. 3. Consider a sample Pentium computerwhich you see in the lab. PENTIUM COMPUTER DETERMINISTIC WALLAH NONDETERMINISTIC WALLAH 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  4. 4. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  5. 5. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  6. 6. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  7. 7. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  8. 8. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  9. 9. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  10. 10. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  11. 11. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  12. 12. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  13. 13. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  14. 14. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  15. 15. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  16. 16. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  17. 17. PROBLEMS TRACTABLE INTRACTABLE11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  18. 18. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  19. 19. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  20. 20. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  21. 21. PROBLEMS TRACTABLE SEEMINGLY TRULY INTRACTABLE INTRACTABLE11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  22. 22. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  23. 23. TRACTABLE PROBLEMS FOR A DETERMINISTIC COMPUTER HEAPSORT, MERGESORT, BUBBLE SORT, BINARY SEARCH, DIJKSTRA’S SINGLE SOURCE SHORTEST PATHS, FLOYD’S ALL PAIRS SHORTEST PATH, HOARE’S QUICKSORT, PRIM’S MINIMUM SPANNING TREE, KRUSKAL’S MINIMUM SPANNING TREE, OPTIMAL BINARY SEARCH TREES,, ETC. ALL THESE PROBLEMS THAT A DETERMINISTIC PENTIMUM COMPUTER CAN SOLVE IN POLYNOMIAL TIME ARE IN THE CLASS P.11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  24. 24. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  25. 25. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  26. 26. SEEMINGLY INTRACTABLE PROBLEMS FOR A DETERMINISTIC PENTIUM COMPUTER AND SEEMINGLY TRACTABLE FOR A NONDETERMINISTIC PENTIUM COMPUTER SATISFIABILITY, 0/1 KNAPSACK, GRAPH COLORING, HAMILTIONIAN CYCLES, TRAVELING SALESMAN PROBLEM, SUM OF SUBSETS, CLIQUE PROBLEM, NODE COVER PROBLEM ETC. THESE PROBLEMS THOUGH ATTACKED FOR HUNDREDS OF YEARS ARE ALWAYS YIELDING EXPONENTIAL COMPLEXITY ALGORITHMS FOR A DETERMINISTIC PENTIUM COMPUTER.11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  27. 27. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  28. 28. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  29. 29. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  30. 30. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  31. 31. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  32. 32. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  33. 33. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  34. 34. TRACTABLE PROBLEMS FOR A NONDETERMINISTIC PENTIUM COMPUTER THE CLASS NP SATISFIABILITY, 0/1 KNAPSACK, GRAPH COLORING, HAMILTIONIAN CYCLES, TRAVELING SALESMAN PROBLEM, SUM OF SUBSETS, CLIQUE PROBLEM, NODE COVER PROBLEM ETC. THESE PROBLEMS THOUGH ATTACKED FOR HUNDREDS OF YEARS ARE ALWAYS YIELDING EXPONENTIAL COMPLEXITY ALGORITHMS FOR A DETERMINISTIC PENTIUM COMPUTER.11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  35. 35. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  36. 36. TRACTABLE PROBLEMS THE CLASS P THE CLASS NP11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  37. 37. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  38. 38. NP-WORLD P-WORLD11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  39. 39. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  40. 40. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  41. 41. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  42. 42. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  43. 43. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  44. 44. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  45. 45. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  46. 46. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  47. 47. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  48. 48. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  49. 49. P=NP11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  50. 50. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  51. 51. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  52. 52. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  53. 53. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  54. 54. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  55. 55. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  56. 56. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  57. 57. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  58. 58. NP-COMPLETE PROBLEMS THE HAMILTONIAN CIRCUIT PROBLEM, THE TRAVELING SALESMAN PROBLEM, THE GRAPH COLORING PROBLEM, THE 0/1 KNAPSACK PROBLEM, THE NODE COVER PROBLEM, THE SUM OF SUBSETS PROBLEM, THE SATISFIABILITY PROBLEM,etc.11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  59. 59. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  60. 60. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  61. 61. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  62. 62. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  63. 63. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  64. 64. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO
  65. 65. 11/08/12 M J COLLEGE OF ENGINEERING AND TECHNOLO

×