CMPT 710 - Computational Complexity - Fall'03

10/9. There will be NO class on Tuesday, Oct 14. The next class is on Thursday, Oct 16. (I'm away till Oct 15.)
10/1. Homework 2 is now available. (Homework 1 is due tomorrow.)
09/30. Because grad seminar is 2:30-3:30 on Tuesdays, I will move my office hour a half hour later so that it will be 3:30-4:30 on Tuesdays. All grad students are strongly encouraged to attend the grad student seminar!
09/29. There was a minor error in Question 5 of the homework: In the definition of f(n), we need to have additional log's. As stated, the definition of f(n) would not allow you to prove that f(n) is computable in poly(n)-time. The corrected version of the homework is now posted. Because of this mix-up, I will allow you to hand in the first homework on Thursday, Oct 2 (instead of tomorrow).
09/11. Complete Homework 1 is now available (see below).
09/09. Homework 1 is now available (see below). It is only partial, that is, there will be more questions added soon. I'm posting it now to encourage you to start working on the problems as soon as possible.
09/2. The first lecture is today.