Next:
10.1 Importance of NP-Completeness
Up:
DSA
Previous:
9.13.1 Heap Sort and Quicksort
10. Introduction to NP-Completeness
10.1 Importance of NP-Completeness
10.2 Optimization Problems and Decision Problems
10.3 Examples of some Intractable Problems
10.3.1 Traveling Salesman Problem
10.3.2 Subset Sum
10.3.3 Knapsack Problem
10.3.4 Bin Packing
10.3.5 Job Shop Scheduling
10.3.6 Satisfiability
10.4 The Classes
P
and
NP
10.5 NP-Complete Problems
10.5.1 NP-Hardness and NP-Completeness
10.6 To Probe Further
10.7 Problems
eEL,CSA_Dept,IISc,Bangalore
