CS170 : Efficient Algorithms and Intractable Problems

This repo contains all the learning materials for UC Berkeley's course CS170 : Efficient Algorithms and Intractable Problems.

Course Map

• Algorithm of Numbers
• Divide and Conquer
• Graph algorithms : shortest-path, MST, graph decomposition
• Greedy algorithm
• Dynamic programming
• Linear programming
• NP problems

Repo Structure

• readings : 9 chapters + 4 supplementary notes
• sections : discussion units covering the important ideas in course
• hws : homework with solution
• solution : my solution for homework
• Latex : latex template for homework and latex tutorials

Want to learn more ?

Check out this repository which contains all my self-learning materials : )