1:30-2:20 MWF, Room 205 MLH
Instructor:
Sriram V. Pemmaraju
101G MLH, sriram@cs.uiowa.edu, 319-353-2956
Office Hours: 9-10 Tuesday, 11:30-12:30 Wednesday, and 9-10 Friday.
This course is a mathematical exploration of the limits of the power of computers. Some of the questions we ask and attempt to answer are the following. Are there problems that cannot be solved on any computer? How does one determine if a given problem can or cannot be computationally solved? If we place bounds on the resources (time and space) available to a computer, then what say about which problems can and which problems cannot be solved on a computer? How does the power of a computer change, if it has access to random bits? What happens when we relax the notion of solving a problem to "approximately" solving a problem - does this fundamentally change which problems can and which problems cannot be solved on a computer?
In attempting to answer these questions we will study languages, Turing machines, undecidability, the classes of problems P, NP, NP-complete, the Cook-Levin theorem, reductions, randomized algorithms and randomized complexity classes such as BPP, approximation algorithms and hardness of approximation. Time permitting, we will also study interactive proofs.
Syllabus document, Information about TAs, Announcements, Homeworks and Exams, Lecture Notes, Online Resources
Office: 101K, MLH Phone: 353-2542 E-mail: rraman@cs.uiowa.edu URL: www.cs.uiowa.edu/~rraman/ Office hours: Wednesday and Friday, 2:30-3:30