Outline
(doc,
html)
Lecture Notes
Readings from the textbook - Algorithm Design, J. Kleinberg and E. Tardos Addison Wesley, 1st Edition 2005 - are given in square brackets, e.g. [KT02; Chapter ??].
- Course Outline and Motivation - Computability through the ages, Euclid's gcd algorithm, Linear Programming, Primality
- P vs NP - Lower bound for searching, Stable Matching [KT02; Chapter 1-3]
Problem Sets
- Problem Set - I
(doc,
html)
- Problem Set - II
(doc,
html)
- Problem Set - III
(doc,
html)
- Problem Set - IV
(doc,
html)
- Problem Set - V
(doc,
html)
Related links
I plan to accumulate related links and organize it from time to time. Please
send me(koods@ccs.neu.edu) any links related to the course that you found useful.
- Avrim Blum's notes on sorting.