CS 125: Algorithms and Complexity (Fall 2014)

Previously taught in Fall 2014; last course offering in Fall 2016.

Course Description
An accelerated introduction to theoretical computer science for students with strong mathematical preparation, to be taken in place of both Computer Science 121 and 124. Algorithm design methods, including graph algorithms, approximation algorithms, and randomized algorithms. Models of computation, computability theory, and computational complexity, including the P vs. NP question.

Fall 2016 Offering (Prof. Jelani Nelson)

• Syllabus
• Schedule and Lecture Notes
• Additional Links for Recommended Reading

Fall 2015 Offering (Profs. Michael Mitzenmacher and Madhu Sudan)

• Syllabus
• Schedule and Lecture Notes (assignments available by request)
• Additional Links for Recommended Reading

Note: for now, please email assignments to cs125harvard, but not at SEAS, instead at gmail.com.

Fall 2014 Offering (Profs. Michael Mitzenmacher and Salil Vadhan)

• Syllabus
• Schedule and Lecture Notes (assignments available by request)