About the Course
Advanced Algorithms and Complexity develops advanced techniques in algorithm design together with the complexity-theoretic foundations of computation. The course explores randomized and advanced algorithmic methods, complexity classes, reductions, hardness, and related topics that help explain both the power and the limitations of efficient computation.
Topics
Deterministic Complexity Classes · Randomized Complexity Classes · Game Theory · Parallel and Distributed Algorithms · Number-Theoretic Algorithms · Counting Complexity Classes · Interactive Proofs · Probabilistically Checkable Proofs