SPRING 2002

Chee Yap

APPROXIMATE SCHEDULE OF LECTURES

No | TOPIC | Week |
---|---|---|

1 | Intro and Finite Automata | Jan 21 (Wed First Class) |

2 | Formal Languages | Jan 28 |

3 | Computability | Feb 4 |

4 | Basic Complexity Relationships | Feb 11 |

5 | Reducibility | Feb 18 (Monday President's day) |

6 | Class NP and Relatives | Feb 25 |

7 | Randomness, Midterm | Mar 4 |

-- | Spring Break | Mar 11 |

8 | More Randomness | Mar 18 |

9 | Polynomial Hierarchy and Relatives | Mar 25 |

10 | Circuit Complexity | Apr 1 |

11 | Interactive Proofs | Apr 8 |

12 | Counting Classes | Apr 15 |

13 | Kolmogorov Complexity | Apr 22 |

14 | Quantum Complexity | Apr 29 |

15 | Quantum Complexity, Review | May 6 (last class) |

-- | Final Exam | May 13 |