Lecturer: Xiaohui Bei ()

Lecture Schedule:

 

Announcements

Material covered

The class consists of two parts: algorithms and complexity. The first part will give a introduction to general algorithm design paradigms as well as algorithms for several specific problems. The second part will talk about topics of automata theory, NP-completeness, and computability.

Lectures

Homework Assignments

Homework policy: You are allowed (and encouraged) to discuss with your peers on the questions and solutions. But everyone needs to write and submit their own solutions.

Homework can be submitted by (as PDF files obtained from LaTeX or Word sources), or by pushing a hard copy under my office door (MAS-05-46).

Recommended Texts

There is no required textbook for this course. However, the following books are recommended: