✳flâneur — a map of the web's best reading
15-859T: A Theorist's Toolkit 2013
cs.cmu.edu · 565 words · saved by 1 readers
Prerequisites Students should have a solid undergraduate background in math (e.g., elementary combinatorics, graph theory, discrete probability, basic algebra/calculus) and theoretical computer science (running time analysis, big-O/Omega/Theta, P and NP, basic fundamental algorithms). Mathematical maturity is a must. Suggested text The Nature of Computation by Cris Moore and Stephan Mertens.
Explore this link on the map →