2000-2001 Program Announcement
Special Year on Computational Complexity
Institute for Advanced Study, Princeton

During the academic year 2000-2001, the School of Mathematics will host a special program on computational complexity theory at the Institute for Advanced Study.

The following researchers will be in residence at the IAS during that year:

    Alexander Razborov, Steklov Mathematical Institute, Russia.
     Johan Hastad, Royal Institute of Technology, Sweden.
     Ran Raz, The Weizmann Institute of Science, Israel.
     Pavel Pudlak, The Czeck Academy of Sciences, Czeck Republic. (Fall term only)

Some topics on which special focus is planned are:
  • Boolean and Algebraic complexity -- ( towards P vs NP ) 
  • Proof complexity -- ( towards NP vs coNP ) 
  • Computational Randomness -- ( towards P vs BPP vs EXP )

We expect to have several  postdoctoral positions, both for 1-year and 2-year periods.
We will also offer membership for more senior visitors, for visits of one year, one term,
as well as shorter visits. The funds for the latter are limited, and people can apply with
their own support.

We encourage everyone interested in the program to apply.
Application forms for membership can be obtained from our homepage, under "How to apply".
All queries can be addressed to

Organizer: Avi Wigderson
Last updated October 5, 1999