LL = Mathematics for Computer Science lecture notes by Eric Lehman and Tom Leighton at MIT.
Warning: this is a 339 page pdf file. You may want to print/view only selected sections mentioned below.
LLM = Mathematics for Computer Science lecture notes by Eric Lehman, Tom Leighton and Albert Meyer at MIT. Warning: this is a 556 page pdf file. You may want to print/view only selected sections mentioned below.
Some of the precise topics for future weeks and associated readings are subject to change.
|Feb 3 2014||Proof Techniques||Chapters 1-3 from LL|
|Feb 5 2014||Proof Techniques, Estimating sums, Growth rate of functions||LL Sections 3.2-3.3, Chapters 10-11, LLM Section 9.7|
|Feb 10 2014||Recurrence Relations||LLM Chapter 10|
|Feb 12 2014||Counting, permutations, binomial theorem||LLM Chapter 11|
|Feb 17 2014||Probabilities, conjunction/disjunction of events, where intuition can go astray||LLM Chapter 14|
|Feb 19 2014||Conditional probabilities, Bayes’s formula, independence.||LLM Chapter 15, 16|
|Feb 24 2014||Random Variables||LLM Chapter 17|
|Feb 26 2014||Expectation of Random Variables||LLM Chapter 18|
|Mar 3, 2014||Deviation from the Mean||LLM Chapter 19|
|Mar 5, 2014||Hashing and Sketching||hashing2011.pdf, sketching2011.pdf|
|Mar 10, 2014||Online algorithms||online1_2014.pdf|
|Mar 12, 2014||Online algorithms||online2_2014.pdf|
|Mar 24, 2014||Game Theory||game_theory_2014.pdf|
|Mar 26, 2014||Linear Programming||game_theory_2014.pdf|
|Mar 31, 2014||Graph Theory: introduction, matching||LLM Chapter 5|
|Apr 2, 2014||Graph Theory: stable marriage, coloring||LLM Chapter 5|
|Apr 7, 2014||Graph Theory: paths, walks, connectivity, euler tour, hamiltonian cycle, TSP, 2-approximation of vertex cover via LP||LLM Chapter 5|
|Apr 9, 2014||Graph Theory: MST, sorting lower bound, random graphs||LLM Chapter 5, sorting lower bound notes (Avrim Blum), readings on random graphs on piazza|
|Apr 14, 2014||Cryptography: Number theory, RSA||LLM Chapter 4|
|Apr 16, 2014||Cryptography||LLM Chapter 4|
|Apr 21, 2014||Computability and Turing Machines||Readings on piazza|
|Apr 23, 2014||Computability and Turing Machines||Readings on piazza|
|Apr 28, 2014||NP-Completeness||Readings on piazza|
|Apr 30, 2014||NP-completeness||Readings on piazza|