Mostly NP-Completeness - Phillip Rogaway and Sanpawat Kantabutra - Chiang Mai University

COMP 789 - Selected Topics in CS: Mostly NP-Completeness - Term 1 of 2004/05

This course will focus on the theory of NP-completeness. We'll spend lots of time doing reductions. Aj. Sanpawat Kantabutra (aka "Bobby") and Aj. Phil Rogaway are running this course together.

Announcements

Today, September 13, will be our last lecture.

General information

Class-by-class summary of topics
Class pictures

Problem sets and the midterm

PS #1
PS #2
PS #3 and PS #3 solns
PS #4 and PS #4 solns
PS #5
Midterm
PS #6

Phil Rogaway's homepage