Math 675 Fall 1996 MW 1:30-3 DRL 4C2

Fall 1996

Math 675, MW 1:30-3 DRL 4C2

Professor Andre Scedrov

Office: Room 4E6 in David Rittenhouse Laboratory
Telephone: eight five nine eight three ( Math. Dept. Office: eight eight one seven eight )
Fax: three four zero six three
E-mail: lastname at math
Office Hours: By appointment

Textbook

C.H. Papadimitriou. "Computational Complexity". Addison-Wesley, 1994, xvi + 523 pp. ISBN 0-201-53082-1.

Topics

This course will discuss advanced topics in complexity theory, such as randomized computation, probabilistic games, optimization, and approximability, covered in Papadimitriou, Chapters 11, 12, 13, 17, and 19.

Other Sources

R. Motwani and P. Raghavan. "Randomized Algorithms". Cambridge University Press, 1995, xiv + 476 pp. ISBN 0-521-47465-5.

M. Sudan. "Efficient Checking of Polynomials and Proofs and the Hardness of Approximation Problems". ACM Distinguished Theses Series. Springer, 1996, xiv + 87 pp. ISBN 3-540-60615-7.

Take-Home Midterm Due in Class Monday, October 28

The following is the complete list of midterm problems:

Problem 11.5.5, textbook p. 272.
Problem 11.5.6, textbook pp. 272-273.
Problem 10.4.7, textbook p. 237.
Problem 11.5.9, textbook p. 274.
Problem 11.5.12ab, textbook p. 274.
Problem 11.5.13, textbook p. 274.
Problem 11.5.14, textbook p. 274.
Problem 11.5.15, textbook p. 274.
Problem 11.5.16a, textbook p. 274.
Problem 11.5.18, textbook p. 274.
Problem 12.3.7, textbook p. 296.

Take-Home Final Exam Due 4 PM Thursday, December 19 in DRL 4E6

The following is the complete list of final exam problems:

Problem 13.4.3, textbook p. 323.
Problem 13.4.4, textbook pp. 323-324.
Problem 13.4.5, textbook p. 324.
Problem 13.4.14, textbook pp. 327-328.
Shamir's Theorem (see textbook pp. 475-480) describes one PSPACE-complete interactive protocol and thus establishes that IP = PSPACE. Come up with another proof of IP = PSPACE, that is, find another PSPACE-complete interactive protocol. Is there a direct reduction from APP to IP?