Workshop on Complexity of Proofs and Computations

December 10, 2000 - December 16, 2000

The workshop is open to the public. There will be no registration fee but we do require all participants to register.


Location Institute for Advanced Study
School of Mathematics
Einstein Drive
Princeton, New Jersey
Pavel Pudlak Alexander Razborov and Avi Wigderson
Eric Allender (Rutgers), Noriko Arai (Univ Hiroshima/Tokio), Arnold Beckmann (Univ Munster),
Maria Bonet (Lenguajes y Sistemas Informaticos),Josh Buresh-Oppenheim (Univ Toronto),
Samuel Buss (UC San Diego), Stephen Cook (Univ Toronto), Stefan Danchev (BRICS),
Lance Fortnow (NEC Research), Russell Impagliazzo (UC San Diego), Jan Johannsen (Univ Munich),
Antonina Kolokolova (Univ Toronto), Jan Krajicek (Math Inst. of Acad. Sciences),
Tsuyoshi Morioka (Univ Toronto), Toniann Pitassi (Univ Arizona), Soren Riis (Queen Mary College),
Steven Rudich (Carnegie Mellon), Jiri Sgall (Math Inst. of Acad. Sciences),
Amir Shpilka (Univ Jerusalem), Alan Skelley (Univ Toronto), Michael Soltys (Univ Toronto),
Gaisi Takeuti (Univ Pennsylvania), Neil Thapen (Oxford, UK), Alasdair Urquhart (Univ Toronto),
Alan Woods (Univ Western Australia), Andrew Yao (Princeton)

Please click here to find the agenda and any papers or slides the
authors have submitted for you to view.


Open Problems



Date & Time

December 10, 2000 | 12:00am – December 16, 2000 | 12:00am