Topics for the Week of April 21, 2008
CS343: Analysis of Algorithms

• Reading: continue Chapter 8: NP and Intractability (sections 1-4)

• Thursday: Begin review for final exam.

• Homework: Continue working on the Graph Game.

• Continue discussion of Chapter 8

  • Defining the (decision) problem.
  • NP - non-deterministical polynomial time
  • Reducibility
  • Certifier
  • NP Complete Algorithms
  • NP Hard
  • Problems: Independent Set, Vertex Cover, Circuit Satisfiability, 3-Satisfiability. TSP, etc
  • NO Completeness: A Retrospective
  • NP-Completeness and 3D Problem in Statistical Mechanics