VVZ API is not affiliated with ETH Zurich. Data might be outdated or incorrect. Please view the official ETHZ Vorlesungsverzeichnis for binding information.
Topics in Mathematics of Computer Science
Last Updated: 2026-02-05 15:23:57
Abstract
Pseudorandomness.
Objective
The goal is to expose math-students to fundamental issues and techniques of one of the most fruitful domain of research in TCS over the past 20 years. We assume the basic ETH-background in Math (Discrete probability, finite fields, NP-completeness) and a minimal exposure to randomized algorithms. The goal is neither Cryptography nor the practical implementation of PRG's.
Content
Pseudorandomness: The lecture will be articulated around concepts like: Pseudorandom generators, expanders, extractors, list-decoding, indistinguishability, hardness versus randomness, derandomization, BPP.
Resources
Lecture Notes
The slides of the lecture will be made available to the students.
General Information
- Language
- English
- Levels
- BSC , MSC
- Frequency
- Yearly recurring
Examination
- Type
- session examination
- Mode
- oral 20 minutes
Course Components
| Type | Title | Time & Place | Hours |
|---|---|---|---|
| lecture | Topics in Mathematics of Computer Science |
|
2 h weekly |
| exercise | Topics in Mathematics of Computer Science |
|
1 h weekly |