PCMI 2000
Graduate Summer School Lecture Schedule
July 17-August 4, 2000
Wolfensohn Hall
| Monday | Tuesday | Wednesday | Thursday | Friday | |
| 10:15 a.m.
11:30 a.m.
1:45 p.m.
|
July 17 Intro. to Complexity Theory through its open questions
Intro. to Complexity Theory… Intro. to Complexity Theory… (Steven Rudich) |
18 Intro. to Complexity Theory through its open questions
Intro. to Complexity Theory… Intro. to Complexity Theory… (Steven Rudich) |
19 Intro. to Complexity Theory through its open questions
Intro. to Complexity Theory… ------ |
20 Exploring complexity through reductions.
Exploring complexity through reductions. Exploring complexity through reductions. (Sanjeev Arora) |
21 Quantum computing
Quantum computing (Ran Raz) |
| 10:15 a.m.
11:30 a.m.
1:45 p.m. |
24 Communication complexity (Ran Raz)
Algebraic Complexity (Michael Ben-Or) |
25 Communication complexity (Ran Raz)
|
26 Communication complexity (Ran Raz)
-------- |
27 Communication complexity (Ran Raz)
|
28 Communication complexity (Ran Raz)
|
| 10:15 a.m.
11:30 a.m.
1:45 p.m. |
31 Pseudorandomness: Interactive Proofs (Salil Vadhan) |
August 1 Pseudorandomness: BMY framework (Oded Goldreich)
Zero knowledge proofs (Salil Vadhan) |
2 Pseudorandomness:
--------- |
3 Pseudorandomness:
|
4 Pseudorandomness: Nisan-Wigderson framework
|
Return to PCMI Summer Session 2000 Page
This page is archival material of the IAS/Park City Mathematics Institute