Complexity (23)

Michael L. Littman

December 9th, 1997

• ANNOUNCEMENTS
• COMPLEXITY
  • Efficient Algorithms
  • Hard Problems
  • Degrees of Hardness
• NP-COMPLETENESS
  • Decision Problems
  • P
  • Nice Puzzle
  • NP
  • Good Guessing
  • Exponential Upperbound
  • NP-hardness
  • Reducibility
  • NP-Completeness
• NP-COMPLETE PROBLEMS
  • Set Covering
  • Decision-Problem Version
  • Hard Problem
  • SAT
  • Hardness of Set Cover
  • Fine Points
  • Graph Coloring
  • Solving 3-colorability
  • Reduction
  • Colorability Complexity for Planar Graphs
• PRACTICE PROBLEMS (incomplete)