Strassen’s Algorithm

1. An explanation of Strassen’s algorithm

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

Boolean Satisfiability

1. The International Conferences on Theory and Applications of Satisfiability Testing (SAT)
2. “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

Map coloring

1. Graph coloring, map coloring, and chromatic number: basics and applications, with worksheets
2. 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

Other NP-Complete Problems

1. Karp’s list of 21 NP-complete problems
   1. Wikipedia’s version of the list
2. An annotated list of NP-complete problems

Approximate Solutions of Hard Problems

1. A compendium of NP optimization problems