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/28Disjoint Sets and Path CompressionSlides
03/07Dynamic ProgrammingSlides
03/14Linear Programming and DualitySlides
03/21Maximum FlowSlides
04/04Zero-Sum GamesSlides
04/11Search Programs and IntractabilitySlides
04/18NP-Complete Problems ISlides
04/25NP-Complete Problems IISlides
05/02NP-Complete Problems IIISlides

© 2018. All lefts reserved.