CISC 5825: Handouts

These are "six-up" versions of the slides that I'm using in class. Feel free to print these out.

• Chapter 0: Prologue
  • An interlude (if necessary): Mathematical induction
• Chapter 1: Algorithms with numbers
• Chapter 2: Divide-and-conquer algorithms
• Chapter 3: Decompositions of graphs
• Chapter 4: Paths in graphs
• Chapter 5: Greedy algorithms
• Chapter 6: Dynamic programming
• Chapter 7: Linear programming and reductions
• Chapter 8: NP-complete problems
• Chapter 9: Coping with NP-completeness
• Chapter 10: Quantum algorithms
• Information-Based Complexity