|
Lecturer: Dr. Maurice Cochand
Assistant: Humberto Naves
This year's course will cover the following topics: pseudorandomness, extractors, indistinguishability, hardness versus randomness, list-decoding, derandomization, and BPP. The
goal is to expose math-students to fundamental issues and techniques of pseudorandomness, one of the most fruitful domain of research in Theoretical Computer Science
over the past 20 years. The goal is neither Cryptography nor the practical implementation of PRG's. Feel free to contact us if you have any questions or remarks concerning the lecture or the exercise class!
Exercises:
Solutions:
Wichtiger Hinweis:
Diese Website wird in älteren Versionen von Netscape ohne
graphische Elemente dargestellt. Die Funktionalität der
Website ist aber trotzdem gewährleistet. Wenn Sie diese
Website regelmässig benutzen, empfehlen wir Ihnen, auf
Ihrem Computer einen aktuellen Browser zu installieren. Weitere
Informationen finden Sie auf
folgender
Seite.
Important Note:
The content in this site is accessible to any browser or
Internet device, however, some graphics will display correctly
only in the newer versions of Netscape. To get the most out of
our site we suggest you upgrade to a newer browser.
More
information