Strassen’s Algorithm

1. An explanation of Strassen’s algorithm

Seven Bridges of Königsberg

1. The Original Problem and some variations

Minimum Spanning Trees

1. Wikipedia's page on minimum spanning trees
2. Minimum spanning trees from the Stonybrook Algorithm Repository

Prime Numbers and Primality Testing

1. Wikipedia’s page on prime numbers
2. The PRIMES is in P FAQ

Shor’s Algorithm and Quantum Computing

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

Boolean Satisfiability

1. Play the FunSAT game - You solve satisfiability puzzles that help chip designers optimize their layoutsa>
" class="main" target="myiframe">Play the FunSAT game
2. The International Conferences on Theory and Applications of Satisfiability Testing (SAT)
3. “The quest for efficient Boolean satisfiability solvers”, Lintao Zhang and Sharad Malik

Does P = NP?

1. The Millennium Problem
   1. The Clay Mathematics Institute’s Millennium Problems page
   2. An excellent description of the problem written by Stephen Cook

NP-Complete Problems

1. Karp’s list of 21 NP-complete problems
   1. Wikipedia’s version of the list
2. Wikipedia's list of NP-complete problems
3. An annotated list of NP-complete problems
4. Forbes Lewis's list with some proofs

Shortest Path Problem

1. Dijkstra's Algorithm
   1. Wikipedia's Page on Dijkstra's Algorithm
   2. Wikipedia's Page on Carla Laffra's Applet

Map coloring

1. Graph coloring, map coloring, and chromatic number: basics and applications, with worksheets
2. The three color problem
   1. NP-completeness of the three color problem
3. The four color problem
   1. The four color problem, including an interactive demonstration
   2. A more recent proof by Neil Robertson, Daniel P. Sanders, Paul Seymour and Robin Thomas

Linear Programming

1. A simplex method tutorial