CS 170
Efficient Algorithms and Intractable Problems

This is the website for Owen's Spring 2018 CS 170 section. Like aforementioned algorithms, this website is efficient.

Info

If necessary, you can reach me via email at owenjow@berkeley.edu. Leave anonymous feedback here. Tell me your favorite bagels and books here.

Section Resources

SectionTopicLink
01/24Divide-and-ConquerSlides
01/31Fast Fourier TransformSlides
02/07Shortest PathsSlides
02/14Greedy Algorithms ISlides
02/21Greedy Algorithms IISlides
02/28Dynamic ProgrammingSlides
03/07Linear ProgrammingSlides
03/14Maximum Flow, MT2Slides
03/21Zero-Sum Games, ReductionsSlides
04/04Search ProblemsSlides
04/11Approximation AlgorithmsSlides
04/18Hashing, StreamingSlides
04/25Multiplicative UpdatesSlides
© 2018. All lefts reserved.