Module #8: Tractable, Intractable, and NP-Complete Problems

Objectives

1. Determine which decidable problems can be computed efficiently
   
2. Define tractable and intractable
   
3. Define NP and NP-Complete
   

Topics

1. Tractable
   
2. Intractable
   
3. Polynomial Time Reduction
   
4. Class P, NP and NP-Complete
   

Background Material

0. Text

Sudkamp: 14.1-14.3 & Chapter 15 (need not read proofs)

1. Wikepedia: Complexity
2. Busch, Shiri & Grahne: Introduction to Complexity
3. Forbes Lewis: More NP-Complete Problems
4. More Wikepedia material
5. Video of P, NP and NP-Complete

Homework

Homework [PDF]

Homework Solutions [PDF]