Silver[COMS W4236] Introduction to Computational Complexity
Departments: Computer Science
Professors: Rocco Servedio
November 14, 2004
Servedio, Rocco 
[COMS W4252] Introduction to Computational Learning Theory and [COMS W4236] Introduction to Computational Complexity
Please keep in mind that this review is more than 5 years old.
DEFINITELY the BEST professor I ever had at Columbia. At the same time, he was definitely the HARDEST professor I ever had at Columbia. I took computational complexity last semester and it was the hardest class I had taken. However, because he was such a great professor, I decided to take computational learning theory, and now i can say that that is the hardest class I've ever taken. However, if you're not afraid to face the challenge, you will find that he is an excellent teacher, and you will definitely learn a lot. I definitely don't consider myself a very motivated learner, but I think the hard work was worth it for these classes.
The styles of the problem sets were very similar in both classes (even though they pertain to very different subject matter). In either class, you will have biweekly problem sets which will each probably take you several days to complete. They consist of about 6 problems, and they are definitely not easy. Your homeworks are to be typed up in LaTeX, and just to give you a general idea, mine averaged something like 7 pages each. Computational complexity had 7 problem sets and a take home final which was basically just another problem set weighted heavier. Computational learning theory had 5 problem sets and a final project, which is yours to come up with.
September 03, 2003
Servedio, Rocco
[COMS W4236] Introduction to Computational Complexity
Please keep in mind that this review is more than 5 years old.
BY FAR the best professor I have had at Columbia. His lectures are very ogranized and he really makes an attempt to explain everything. He is a sincerely nice guy and actually cares whether or not his students understand the material. Some of the stuff covered in this course is really complex, but he is able to break it down to make it more understandable. He likes when students ask questions in class and he really tries to make sure he answers them sufficiently. He tries to get to know the names of all his students. His office hours are really helpful...they were always packed when I took this class. In a nutshell...this guy is awesome.
Pretty crazy. 6 problem sets. They were all pretty hard but the last one was insane. Take home final which was relatively easy.
Directory Data
| Dept/Subj | Directory Course | Professor | Year | Semester | Time | Section |
|---|---|---|---|---|---|---|
| COMS / COMS | COMS COMS W4236: Introduction to Computational Complexity | Mihalis Yannakakis | 2005 | Spring | MW / 2:40- 3:55 PM | 1 |