Computational Complexity

Catalog description

Focuses on central concepts in theoretical computer science, including NP-hardness, reductions, approximation algorithms, and fixed parameter algorithms. Samples modern algorithmic topics such as streaming, online, randomized, probabilistic, distributed, and quantum computations. Studies hard computational problems in both combinatorial and geometric settings.