Complexity and Probability, Gothenburg 15-19 April

[Pekka Orponen]

Complexity and Probability

A one week workshop/advanced research course on
"Complexity and Probability" is being organized
at Chalmers University of Technology through the
Stochastic Center of Gothenburg. This course/workshop
will be held April 15-19. The two speakers will be Johan
Hastad (Nada, KTH) who will speak on "The PCP Theorem
and its Application to proving Inapproximability Results"
and Peter Bro Miltersen (Department of computer science,
University of Aarhus) who will speak on
"Universal Methods for Derandomization".

See the WWW page

http://www.math.chalmers.se/~fredrikl/events/RandomWorkshop

for details.