Computer Science 663
Theory of Computation
Weizhen Mao
Department of Computer Science
College of William and Mary
General Information |
Schedules |
Announcements |
Lectures |
Assignments |
Exams
Schedules
Week 1:
A brief history of Theory of Computation
Week 2:
Turing machines.
Week 3:
More on 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 and NP-complete problems.
Week 9:
More on NP-complete problems.
Week 10:
More on NP-complete problems.
Week 11:
More on NP-complete problems.
Week 12:
Solving NP-complete problems.
Week 13:
More on solving NP-complete problems.
Week 14:
Mini-presentations.
Week 15:
More mini-presentations.