# 600.471: Modern Complexity Theory

# Spring Term 2001

## Christian Scheideler

### Lectures

Mon 4.00 - 5.15 p.m. Shaffer 300 Scheideler

Tue 4.00 - 5.15 p.m. Shaffer 300 Scheideler

### Topics

Topics covered will be polynomial complexity classes and beyond,
complexity of logic and arithmetics, cryptography and complexity,
interactive proof systems and probabilistically checkable proofs,
nonapproximability, and new directions including Quantum computing and
complexity of evolutionary systems. [Analysis]

### Grading

- 1/3: assignments
- 1/3: mid-term exam
- 1/3: final exam

### Syllabus

- Jan 29, 30: Computational Models
- Feb 5, 6: Set Theory and Complexity
- Feb 12, 13: Time and Space
- Feb 19, 20: Complexity of Logic
- Feb 26, 27: Complexity of Arithmetics
- Mar 5: Open Discussion
- Mar 6: Midterm Exam
- Mar 12, 13: Interactive Proof Systems
- Mar 19, 20: Spring Vacation
- Mar 26: canceled
- Mar 27: Probabilistically Checkable Proofs
- Apr 2, 3: Approximation and Complexity
- Apr 9, 10: Quantum Complexity Theory I
- Apr 16, 17: Quantum Complexity Theory II
- Apr 23, 24: Evolutionary Systems I
- Apr 30, May 1: Evolutionary Systems II
- May 7: Open Discussion
- May 8:

### Assignments

Christian Scheideler
Last modified: Tue Feb 13 2001