Computer Science 663
Theory of Computation
Spring, 2009
Weizhen Mao
Department of Computer Science
College of William and Mary
General Information |
Schedules |
Announcements |
Lectures |
Assignments |
Exams
Schedules
Week 1:
Problems and algorithms.
Weeks 2 and 3:
Turing machines.
Week 4:
Undecidabilty.
Week 5:
More on undecidability.
Week 6:
Relations between complexity classes.
Week 7:
Reductions and completeness.
Week 8:
Spring break.
Week 9:
NP-complete problems.
Week 10:
More on NP-complete problems.
Week 11:
More on NP-complete problems.
Week 12:
More on NP-complete problems.
Week 13:
Solving NP-complete problems.
Week 14:
More on solving NP-complete problems.
Week 15:
More on solving NP-complete problems.
Last modified: January 12, 2009