Efficient Algorithms and Intractable Problems (CS 170)

Undergraduate course, UC Berkeley, EECS, 1900

Teaches core algorithmic concepts in Computer Science, including Divide-and-Conquer, Graph, Greedy Algorithms, Dynamic Programming, Linear Programming, Reductions, P vs. NP, Streaming, etc.