AM 106/206. Applied Algebra.

    Sets, subsets, and partitions; mappings, operations, and equivalence relations; groups, rings, and fields, polynomials, encryption, computer coding, application of modular arithmetic, combinatorial designs, lattices, application of trellis representation of lattices, fast algorithms;...

    Read more about AM 106/206. Applied Algebra.

    CS 225. Pseudorandomness.

    Efficiently generating objects that ``look random'' despite being constructed using little or no randomness. Connections and applications to computational complexity, cryptography, and combinatorics. Pseudorandom generators, randomness extractors, expander graphs, error-correcting codes,...

    Read more about CS 225. Pseudorandomness.