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

• Reading: begin Chapter 8: NP and Intractability

• Homework:

  • Demo and turn in LCS algorithm.

  • Discuss final project.

    • Specify Game Rules and Structure
    • Look at UML Document
    • Play Game and Analyze Strategy GraphGameProject.zip. Please not that this is a rough version.
    • Implementing Strategy in Code

• Begin 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