Computer Science 170: Efficient Algorithms and Intractable Problems

Alessandro Chiesa, James W Demmel, Spring 2020
Notes taken by Vanshaj Singhania

DateLecture Topic
January 19Introduction, Big-O, Arithmetic
January 21Divide and Conquer
January 26Divide and Conquer
January 28Fast Fourier Transform
February 2Decomposition of Graphs
February 4Paths in Graphs
February 9Paths in Graphs
February 11Greedy Algorithms
February 16Minimum Spanning Trees
February 23Huffman Encoding, Horn Formulas
February 25Dynamic Programming
March 2Dynamic Programming
March 4Linear Programming

All notes belong to me. All course content belongs to course staff.