Overview

1. Sedgewick and Wayne’s introduction to complexity
2. Arora and Barak’s manuscript
3. Lance Fortnow and Steve Horner’s history of complexity
4. The Complexity Zoo

Traveling Salesman Problem

Quantum Computing

1. Wikipedia's page on Shor's Algorithm
2. Matthew Hayward's page on Shor's Algorithm and Quantum Computing

Asymptotic Dominance

1. The NIST pages
2. Prof Shunichi Toida’s page on the growth of functions
3. Wikipedia’s entry

String Searching

1. The Knuth-Morris-Pratt algorithm
   1. Wikipedia’s entry
   2. David Eppstein’s description

Greatest Common Divisor and Euclid’s Algorithm

1. Wikipedia’s entry, with history and discussion, including correctness proof

Fast Algorithms for Matrix Multiplication

1. Coppersmith-Winograd algorithm, with timereq Î O(n^2.376)
   1. Wikipedia’s entry
2. Strassen’s algorithm
   1. An explanation of Strassen’s algorithm