Princeton University
Computer Science Dept.

Computer Science 522
Computational Complexity

Andy Yao

What's New?

Spring 2000


General Information | Schedule and Assignments | What's New?

March 21: correction to Problem 3 of Homework Set 2 -- we require that n be of the form p+p^k where k is a positive integer. Thanks to Subhash Khot for pointing out the error. As announced in class today, there is no class for this Thursday (March 23), due to the Princeton Area Theory Conference at NEC Research.
February 16: Two corrections on the Homework Set 1 -- first, in the statement of Farkas Lemma II, it should read "If \emptyset \not= H \subseteq G .." and second, in Problem 4, it should read ".. C_2(P) \leq 8". These corrections together with the statement of Farkas Lemma as given in class have been incorporated in the new version of Homework Set 1, and posted on the web. Thanks to Bo Brinkman for bringing the error of G-H reversal to my attention.