Topics, Exams and Homework Assignments

Week Dates Topics Sections Covered Homework Due
1Jan 15—Jan 17 Measuring complexity.
2Jan 20—Jan 24 Dynamic programming and greedy algorithms. Discrete vs. continuous optimization. Chapter 1
3Jan 27—Jan 31 Review of graphs and NP-hard problems, e.g. finding Hamiltonian paths, cliques, etc. Chapter 1
4Feb 3—Feb 7 Review of graphs and NP-hard problems, e.g. finding Hamiltonian paths, cliques, etc. Chapter 2, 3
H1:  H1
Feb 15
5Feb 10—Feb 14 Solving problems by message passing. Belief propagation.
6Feb 17—Feb 21 Solving problems by message passing. Belief propagation.
7Feb 24—Feb 28 Ising-type models. Sampling. Partition function.
H2:  H2
March 11
8Mar 2—Mar 6 Ising-type models. Sampling. Partition function.
H3:  H3
April 15 11
Mar 9—Mar 13Spring Recess.
9Mar 16—Mar 20 Graphical models.
10Mar 23—Mar 27 Graphical models.
11Mar 30—Apr 3 Counting.
12Apr 6—Apr 10 Phase transitions in computing.
13Apr 13—Apr 17 Phase transitions in computing.
14Apr 20—Apr 24 Basics of quantum computing.
16Apr 27—May 1 Basics of quantum computing.
17May 4—May 6 Review. All.
17May 7 Reading Day - no classes or finals
Finals WeekMay 14 (Thursday) Final Exam, 8:00 am - 10:00 am (regular room). NOTE: This class has no final exam.