Adv Topics in Theoretical CS

3 Credits · Level: Graduate, Undergraduate

This course explores open problems and recent breakthroughs in computational complexity. Topics include circuit lower bounds, fine-grained complexity, derandomization, hardness of approximation, and more. Emphasis is placed on understanding the techniques that have led to recent progress. The course is designed for graduate students with experience in theoretical computer science.