Workshop on Complexity of Proofs and Computations

Location

Institute for Advanced Study
School of Mathematics
Einstein Drive
Princeton, New Jersey

Scientific Organizers

Pavel Pudlák
Alexander Razborov
Avi Wigderson

Participants

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)

Agenda Note It contains links to many papers and
slides submitted by speakers.

Date & Time

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

Categories