| Date | Lecture | Handout |
| Monday 6/29 | Dating and Stable Marriage | [pdf] |
| Tuesday 6/30 | Infinity and Diagonalization | [pdf] |
| Thursday 7/2 | Computability | [pdf] |
| Friday 7/3 | How to Multiply Faster | [pdf] |
| Monday 7/6 | Recursion and Divide and Conquer P vs NP (Part 1) |
handout for recursion [pdf] handout for P vs NP [pdf] extra info on P vs NP: [URL1], [URL2] |
| Tuesday 7/7 | P vs NP (Part 2) Modular Arithmetic |
[pdf] |
| Friday 7/10 | Basic Probability | [pdf] |
| Monday 7/13 | Polynomials and Error Correcting Codes | [pdf] |
| Tuesday 7/14 | Random Primes and Communication Complexity | [pdf] |
| Friday 7/17 | Digital Envelopes, Zero Knowledge, and other wonders of modern cryptography.
(How computational complexity enables digital privacy.) Guest Lecture by Prof. Sanjeev Arora |
[pdf] |