Fall, 2015

** Students should consult this page at least once a week
for important information. **

** Lectures: ** Tues 12-2 **NEW ROOM: PT 266**

** Instructor: ** Toniann Pitassi, email: toni@cs

Office: Sandford Fleming 2305A, 978-3695

Office Hours: Tuesday 2-3 and by appointment

** Text: ** Complexity Theory: A Modern Approach, by
Sanjeev Arora and Boaz Barak.
A draft of the book can be obtained for free from the following
website.

** LECTURE NOTES: **

- Sample scribe notes
- Lecture 1
- Lecture 2
- Lecture 3
- Lecture 4
- Lecture 5
- Lecture 6
- Lecture 7
- Lecture 8
- Lecture 9
- Lecture 10
- Lecture 11

** HOMEWORK ASSIGNMENTS: **

** HANDOUTS AND PAPERS: **

- The P versus NP problem, by Steve Cook
- On the history and status of the P versus NP Problem, by Michael Sipser
- NP-Completeness: A Retrospective, by Christos Papadimitriou
- A Switching Lemma Primer, by Paul Beame
- Symmetric Approximation Arguments for Monotone Lower Bounds without Sunflowers, by Berg and Ulfberg

** USEFUL LINKS: **

- The Complexity Zoo
- Lance Fortnow's Complexity Weblog
- Clay Mathematics Institute Millennium Problems
- Electronic Colloquium on Computational Complexity