Hi everyone,
Please find the solutions to Assignment 8 on-line.
I have finalized the schedule for this course. We will drop
the topic on space complexity.
Nov. 22, 2000: Some NP problems and the P = NP question
Nov. 27, 2000: SAT problem and NP completeness
Nov. 29, 2000: Cook-Levin Theorem.
Dec. 01, 2000: Final Review
Dec. 05, 2000: Final (Time: 1:30 - 3:30 PM at Swift 501)
Notice that Cook-Levin's theorem is probably the most
difficult theorem in the textbook. So I recommend that
you read it before my lecture.
--Hongwei
(This is message for the class 20-ECES-670-2)