"This project is concerned with the necessity and availability of randomness in computation. This research area (often referred to as the ""Theory of Derandomization'') is one of the most active and exciting areas in theoretical computer science. We intend to study some of the main questions of this area: In what setups can randomized algorithms be efficiently simulated by deterministic ones? In c ...