main page
— CS 627 Advanced Algorithms
Unit 8: Randomized Complexity
This unit covers
- probabilistic complexity classes
- pseudo-random generators
- derandomization
Material
— to be added —
Further reading and sources
The exposition mostly follows
- S. Arora and B. Barak: Computational Complexity: A Modern Approach
Unit 7
⋅
Syllabus
⋅
Unit 9