CS 136. Economics and Computation

    he interplay between economic thinking and computational thinking as it relates to electronic commerce, incentives engineering, and networked systems

    CS 221. Computational Complexity

    Computational complexity aims to understand the fundamental limitations and capabilities of efficient computation.  For example, which computational problems inherently require a huge running time to solve, no matter how clever an algorithm one designs? This most basic question of computational complexity is now understood to be both extremely difficult and of great importance, as demonstrated by all the attention given to the famous P vs. NP question.... Read more about CS 221. Computational Complexity

    AM 107. Graph Theory and Combinatorics

    Topics in combinatorial mathematics that find frequent application in computer science, engineering, and general applied mathematics. Specific topics taken from graph theory, enumeration techniques, optimization theory, combinatorial algorithms, and discrete probability.

    AM 221. Advanced Optimization

    This is a graduate-level course on optimization. The course covers mathematical programming and combinatorial optimization from the perspective of convex optimization, which is a central tool for solving large-scale problems. In recent years convex optimization has had a profound impact on...

    Read more about AM 221. Advanced Optimization

    MATH 155r. Combinatorics

    An introduction to counting techniques and other methods in finite mathematics. Possible topics include: the inclusion-exclusion principle and Mobius inversion, graph theory, generating functions, Ramsey's theorem and its variants, probabilistic methods.